C++代码:
//LCS问题(动态规划)
string CommonSubsquence(string s1, string s2)
{
int size1 = s1.size();//一维
int size2 = s2.size();//二维
size1++;
size2++;
//开辟数组
int ** p = new int*[size2];
p[0] = new int [size1*size2];
memset(p[0],0,sizeof(int)*size1*size2);
for(int i=1; i<=size2-1; i++)
p[i] = p[i-1] + size1;
//dp过程
for(int j=1; j<size2; j++)
{
for(int i=1; i<size1; i++)
{
if(s1[i-1] == s2[j-1])
{
p[j][i] = p[j-1][i-1]+1;
}
else
{
p[j][i] = max(p[j-1][i],p[j][i-1]);
}
}
}
//输出结果
for(int i=0; i<size1; i++)
{
for(int j=0; j<size2; j++)
{
cout<<p[j][i]<<' ';
}
cout<<endl;
}
//输出字符串
string s;
for(int i=size1-1,j=size2-1; i>0&&j>0;)
{
if(s1[i-1]==s2[j-1])
{
s.push_back(s1[i-1]);
i--;
j--;
}
else
{
//if(p[j][i-1]>=p[j-1][i]) "BDAB"
if(p[j][i-1]>=p[j-1][i]) //"BCBA"
i--;
else
j--;
}
}
reverse(s.begin(),s.end());
//释放数组
delete[] p[0];
delete p;
return s;
}