最长公共子序列

<span style="font-size:14px;">#include<iostream>#include<iomanip>#include<vector>#include<algorithm>using namespace std;class LCSLength{public :LCSLength(){cin >> m >> n;X.assign(m+1, '0');Y.assign(n+1, '0');for (int i = 1; i < X.size(); i++){char x;cin >> x;X[i] = x;}for (int j = 1; j < Y.size(); j++){char y;cin >> y;Y[j] = y;}for (int i = 0; i <= m; i++)//把第0行都用上{vector<int> item2(n + 1, 0);c.push_back(item2);}}//自底向上写法void DynMLS(){for (int i = 1; i <= m; i++)//逐行填表{for (int j = 1; j <= n; j++){if (X[i] == Y[j]){c[i][j] = c[i - 1][j - 1] + 1;}else{c[i][j] = c[i-1][j] >= c[i][j-1] ? c[i -1][j]: c[i][j-1];}}}}//递归写法void RecMLS(int i , int j){if (i != 0 && j != 0){RecMLS(i - 1, j - 1);RecMLS(i - 1, j);RecMLS(i, j - 1);if (X[i] == Y[j]){c[i][j] = c[i - 1][j - 1] + 1;//RecMLS(i - 1, j - 1);//写在这表不会填满}else{//RecMLS(i - 1, j);//RecMLS(i, j - 1);c[i][j] = c[i - 1][j] >= c[i][j - 1] ? c[i - 1][j] : c[i][j - 1];}}}void TraceBack(int i , int j){if (i != 0 && j != 0){if (X[i] == Y[j]){L.push_back(X[i]);TraceBack(i - 1, j - 1);}else{if (c[i - 1][j] >= c[i][j - 1]){TraceBack(i - 1, j);}else{TraceBack(i, j - 1);}}}}void print(){for (int i = 0; i <= m; i++){ for (int j = 0; j <= n; j++){cout << setw(4)<<c[i][j] << " ";}cout << endl;}for (int i = L.size() - 1; i > 0; i--){cout << L[i] << ",";}cout << L[0] << endl;;}public:vector<char> X;//序列Xvector<char> Y;//序列Yint m, n;//m : 序列X的长度， n : 序列Y的长度vector<char> L;//最长公共子序列vector<vector<int> > c;//c[i][j]:序列Xi和序列Yj的最长公共子序列长度vector<vector<int> > b;//};LCSLength LCS;int main(){//LCS.DynMLS();LCS.RecMLS(LCS.m , LCS.n);LCS.TraceBack(LCS.m,LCS.n);LCS.print();return 0;}</span>