Przejdź do treści

Najdłuższy wspólny podciąg

Opis problemu

Implementacja

 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
#include <iostream>

using namespace std;

string longestCommonSubsequence(string a, string b) {
    int matrix[a.length() + 1][b.length() + 1] = {};
    int value, i, j;
    string result = "";

    for (i = 1; i <= a.length(); i++) {
        for (j = 1; j <= b.length(); j++) {
            if (a[i - 1] == b[j - 1]) {
                matrix[i][j] = matrix[i - 1][j - 1] + 1;
            } else {
                matrix[i][j] = max(matrix[i - 1][j], matrix[i][j - 1]);
            }
        }
    }

    value = matrix[a.length()][b.length()];
    i = a.length();
    j = b.length();

    while (value > 0) {
        if (matrix[i - 1][j] == value) {
            i--;
        } else if (matrix[i][j - 1] == value) {
            j--;
        } else {
            result = a[i - 1] + result;
            i--;
            j--;
            value--;
        }
    }

    return result;
}

int main() {
    string a = "kitten";
    string b = "sitting";

    string lcs = longestCommonSubsequence(a, b);

    cout << lcs << endl;

    return 0;
}