mooc笔记
老师: 郭炜
动态规划
递推
状态
用时间换空间
打印输出debug
#include<iostream>
#include<cstring>
using namespace std;
const int MAX=1000;
int maxLen[MAX][MAX];
int main(){
int i,j;
string str1,str2;
cin>>str1>>str2;
memset(maxLen,0,sizeof(maxLen));
for(i=1;i<=str1.length();++i){
for(j=1;j<=str2.length();++j){
if(str1[i-1]==str2[j-1]){
maxLen[i][j]=maxLen[i-1][j-1]+1;
}else{
maxLen[i][j]=max(maxLen[i-1][j],maxLen[i][j-1]);
}
}
}
cout<<maxLen[str1.length()][str2.length()]<<endl;
return 0;
}