//最长公共子序列问题
#include <string>
#include <iostream>
using namespace std;
#define N 100
int main()
{
string first;
cin>>first;
cout<<"字符串1:"<<first<<endl;
string second;
cin>>second;
cout<<"字符串2:"<<second<<endl;
int f=first.length()+1;
int s=second.length()+1;
int contain[N][N];//计算长度时候用的矩阵
int i,j;
for(i=0;i<f+1;i++)
{
for(j=0;j<s+1;j++)
{
contain[i][j]=0;//进行初始化
}
}
for(i=1;i<f+1;i++)
{
for(j=1;j<s+1;j++)
{
if(first[i-1]!=second[j-1])//当i和j的值不相等时
{
if(contain[i][j-1]>contain[i-1][j])
contain[i][j]=contain[i][j-1];
else
contain[i][j]=contain[i-1][j];
}
else
{
contain[i][j]=contain[i-1][j-1]+1;
}
}
}
cout<<"对应的矩阵:"<<endl;
for(i=0;i<f;i++)
{
for(j=0;j<s;j++)
{
cout<<contain[i][j]<<" ";//进行初始化
}
cout<<endl;
}
cout<<"......................"<<endl;
cout<<"最长公共子序列的长度为:"<<endl;
cout<<contain[f-1][s-1]<<endl;//最后求的值
getchar();
getchar();
return 0;
}
#include <string>
#include <iostream>
using namespace std;
#define N 100
int main()
{
string first;
cin>>first;
cout<<"字符串1:"<<first<<endl;
string second;
cin>>second;
cout<<"字符串2:"<<second<<endl;
int f=first.length()+1;
int s=second.length()+1;
int contain[N][N];//计算长度时候用的矩阵
int i,j;
for(i=0;i<f+1;i++)
{
for(j=0;j<s+1;j++)
{
contain[i][j]=0;//进行初始化
}
}
for(i=1;i<f+1;i++)
{
for(j=1;j<s+1;j++)
{
if(first[i-1]!=second[j-1])//当i和j的值不相等时
{
if(contain[i][j-1]>contain[i-1][j])
contain[i][j]=contain[i][j-1];
else
contain[i][j]=contain[i-1][j];
}
else
{
contain[i][j]=contain[i-1][j-1]+1;
}
}
}
cout<<"对应的矩阵:"<<endl;
for(i=0;i<f;i++)
{
for(j=0;j<s;j++)
{
cout<<contain[i][j]<<" ";//进行初始化
}
cout<<endl;
}
cout<<"......................"<<endl;
cout<<"最长公共子序列的长度为:"<<endl;
cout<<contain[f-1][s-1]<<endl;//最后求的值
getchar();
getchar();
return 0;
}