-
Notifications
You must be signed in to change notification settings - Fork 0
/
printingSubsequence.cpp
76 lines (69 loc) · 1.35 KB
/
printingSubsequence.cpp
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
65
66
67
68
69
70
71
72
73
74
75
76
#include <iostream>
#include <vector>
using namespace std;
int t[4][4];
int lcs(int x, int y, string s1, string s2)
{
for (int i = 1; i <= x; i++)
{
for (int j = 1; j <= y; j++)
{
if (s1[i - 1] = s2[j - 1])
{
t[i][j] = 1 + t[i - 1][j - 1];
}
else
{
t[i][j] = max(t[i - 1][j], t[i][j - 1]);
}
}
}
return t[x][y];
}
int main()
{
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 4; j++)
{
if (i == 0 || j == 0)
t[i][j] = 0;
}
}
int A = 3, B = 3;
string str1 = "abc";
string str2 = "abc";
vector<char> c;
lcs(A, B, str1, str2);
do
{
if (str1[A - 1] == str2[B - 1])
{
c.push_back(str1[A - 1]);
A--, B--;
}
else
{
if (t[A - 1][B] >= t[A - 1][B])
{
A = A - 1, B = B;
}
else
{
A = A, B = B - 1;
}
}
} while (A != 0 && B != 0);
for (auto i : c)
cout << i << " ";
cout << endl;
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 4; j++)
{
cout << t[i][j] << " ";
}
cout << endl;
}
return 0;
}