-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathday084.c
64 lines (57 loc) · 1.22 KB
/
day084.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <stdio.h>
int checkForsub_seq(int num_1, int num_2){
int num_1_digit, num_2_digit;
while(num_1 != 0){
num_1_digit = num_1%10;
while(num_2 != 0){
num_2_digit = num_2%10;
if(num_1_digit == num_2_digit)
return num_1;
else
num_2 /= 10;
}
num_1 /= 10;
}
return 0;
}
int main(void) {
int arr[50], arr_size, flag, adj_ele[50], final_arr[50];
printf("Enter the size of the array\n");
scanf("%d", &arr_size);
printf("Enter %d elements\n", arr_size);
for(int i=0; i<arr_size; i++)
scanf("%d", &arr[i]);
int k = 0;
for(int i=0; i<arr_size; i++){
for(int j=i+1; j<arr_size; j++){
if(checkForsub_seq(arr[i], arr[j])){
adj_ele[k] = arr[i];
k++;
adj_ele[k] = arr[j];
k++;
}
}
}
int count = 0, d=0;
for (int c = 0; c < k; c++){
for (d = 0; d < count; d++)
{
if(adj_ele[c] == final_arr[d])
break;
}
if (d == count)
{
final_arr[count] = adj_ele[c];
count++;
}
}
printf("The longest subsequence is ");
for(int i=0; i<count; i++){
if(i==count-1){
printf("%d", final_arr[i]);
}else{
printf("%d,", final_arr[i]);
}
}
return 0;
}