You are viewing a single comment's thread. Return to all comments →
vector longestCommonSubsequence(vector a, vector b) { int m=a.size(); int n=b.size(); int t[m+1][n+1]; for(int i=0;i ans; while(i>0 && j>0){ if(a[i-1]==b[j-1]){ ans.push_back(a[i-1]); i--; j--; } else{ if(t[i][j-1]>t[i-1][j]){ j--; } else{ i--; } } } reverse(ans.begin(),ans.end()); return ans; }
Seems like cookies are disabled on this browser, please enable them to open this website
The Longest Common Subsequence
You are viewing a single comment's thread. Return to all comments →
vector longestCommonSubsequence(vector a, vector b) { int m=a.size(); int n=b.size(); int t[m+1][n+1]; for(int i=0;i ans; while(i>0 && j>0){ if(a[i-1]==b[j-1]){ ans.push_back(a[i-1]); i--; j--; } else{ if(t[i][j-1]>t[i-1][j]){ j--; } else{ i--; } } } reverse(ans.begin(),ans.end()); return ans; }