输出所有最长公共子序列 lcs 动态规划

问题描述：给定s1 = “ABCBDAB”,s2 = “BDCABA”,求解s1和s2的最长公共子序列，注意不是子串。

#include<bits/stdc++.h>
using namespace std;
string s1 = "ABCBDAB",s2 = "BDCABA";
vector<vector<int> > dp;
int num = 0;
struct node{
    string s;
    int id;
    bool operator < (const node &a) const{//id小的优先级小
        return id < a.id;
    }
    node(string s,int id):s(s),id(id){}
};

set<node> slcs;//默认是小根堆
class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        int index = 1;
        int len1 = text1.length();
        int len2 = text2.length();
        dp = vector<vector<int> >(len1 + 1,vector<int>(len2 + 1,0));
        for(int i = 1; i <= len1; i++){
            for(int j = 1; j <= len2; j++){
                if(text1[i - 1] == text2[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
                else{
                    dp[i][j] = max(dp[i - 1][j],dp[i][j - 1]);
                }
            }
        }
        return dp[len1][len2];
    }
    void traceback(int m,int n,string s){//回溯输出所有子序列
        while(m > 0 && n > 0){
            if(s2[m - 1] == s1[n - 1]){
                s.push_back(s2[m - 1]);
                m--;n--;
            }
            else{
                if(dp[m - 1][n] > dp[m][n - 1]){
                    m--;
                }else if(dp[m - 1][n] < dp[m][n - 1]){
                    n--;
                }else{
                     traceback(m, n - 1, s);
                     traceback(m - 1, n,s);
                    return ;
                }
            }
        }
        reverse(s.begin(),s.end());
        slcs.insert(node(s,num++));
    }

};
int main(){
    Solution s;
    int a = s.longestCommonSubsequence(s2,s1);
    printf("%d\n",a);
    string ss;
    s.traceback(s2.length(),s1.length(),ss);
    for( set<node>::iterator it = slcs.begin(); it != slcs.end(); it++) cout << it->s << endl;
}