题目描述:
Find a longest common subsequence of two strings.
输入:
First and second line of each input case contain two strings of lowercase character a…z. There are no spaces before, inside or after the strings. Lengths of strings do not exceed 100.
输出:
For each case, output k – the length of a longest common subsequence in one line.
样例输入:
abcd
cxbydz
样例输出:
2
算法思想:
用dp[i][j]表示str1[i]和str2[j]处两字符串的最大公共子序列,则状态转移方程为:
若str1[i]==str2[j],则dp[i][j]=dp[i-1][j-1]+1;
若str1[i]!=str2[j],则dp[i][j]=max{dp[i-1][j],dp[i][j-1]};
其中dp[i][0]=0,dp[0][j]=0;
算法实现:
#include <stdio.h>
#include <string.h>
#define MAXN 101
int dp[MAXN][MAXN];
char str1[MAXN];
char str2[MAXN];
int main(){
scanf("%s\n%s",str1+1,str2+1);
int len1=strlen(str1+1);
int len2=strlen(str2+1);
int max=0;
for(int i=0;i<=len1;i++){
for(int j=0;j<=len2;j++){
if(i==0||j==0){
dp[i][j]=0;
continue;
}
if(str1[i]==str2[j])
dp[i][j]=dp[i-1][j-1]+1;
else{
dp[i][j]=dp[i-1][j];
if(dp[i][j]<dp[i][j-1])
dp[i][j]=dp[i][j-1];
}
if(dp[i][j]>max)
max=dp[i][j];
}
}
printf("%d",max);
}
注意:
scanf("%s\n%s",str1+1,str2+1)表示输入的字符串下标从1开始;