也可以找字符串的最大子序列,然后相减即可,但没有验证过。
int main ()
{
string s1,s2;
while( cin>>s1>>s2)
{
int len1 = s1.size();
int len2 = s2.size();
vector<vector<int>> dp(len1+1, vector<int>(len2+1,0));
for(int i = 0; i <= len1; i++)
dp[i][0] = i;
for(int i = 0; i <= len2; i++)
dp[0][i] = i;
//
for(int i = 1; i <= len1; i++){
for(int j = 1; j <= len2; j++){
if(s1[i-1] == s2[j-1])
dp[i][j] = dp[i-1][j-1];
else{
int tmp = min(dp[i-1][j], dp[i][j-1]);
dp[i][j] = 1 + min(tmp, dp[i-1][j-1]);
}
}
}
cout<<dp[len1][len2]+1<<endl;
}
return 0;
}
int main ()
{
string s1,s2;
while( cin>>s1>>s2)
{
int len1 = s1.size();
int len2 = s2.size();
vector<vector<int>> dp(len1+1, vector<int>(len2+1,0));
for(int i = 0; i <= len1; i++)
dp[i][0] = i;
for(int i = 0; i <= len2; i++)
dp[0][i] = i;
//
for(int i = 1; i <= len1; i++){
for(int j = 1; j <= len2; j++){
if(s1[i-1] == s2[j-1])
dp[i][j] = dp[i-1][j-1];
else{
int tmp = min(dp[i-1][j], dp[i][j-1]);
dp[i][j] = 1 + min(tmp, dp[i-1][j-1]);
}
}
}
cout<<dp[len1][len2]+1<<endl;
}
return 0;
}