最长公共子序列
最后更新于：2022-04-01 20:30:52
~~~
int ** lcsLength(int *x,int *y,int m,int n){
int b[m][n],c[m][n];
for(int i=0;ic[i][j-1]){
c[i][j] = c[i-1][j];
b[i][j] = 2;
}
else {
c[i][j] = c[i][j-1];
b[i][j] = -1;
}
}
}
int **a = new int*[m];
for(int i=0;i
';