首先,可以将s1视为空串,则在s2字符影响下的最少次数用dp[i][j]表示,代表在空串下转化为i~j的最少次数
然后再次用s1与s2相匹配,如果存在相同位置相同字符,那么当前位置可以减少一次字符转换。令ans[i]表示长度从0~i需要的步数,那么存在s1[i] == s2[2]的情况时,ans[i]满足ans[i] = ans[i - 1];
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
char s1[105], s2[105];
int dp[105][105];
int ans[105];
int main()
{
while (~scanf("%s%s", s1, s2)){
int len = strlen(s1);
memset(dp, 0, sizeof(dp));
for (int j = 0; j < len; j++){
for (int i = j; i >= 0; i--){
dp[i][j] = dp[i + 1][j] + 1;
for (int k = i + 1; k <= j; k++){
if (s2[i] == s2[k])
dp[i][j] = min(dp[i][j], dp[i + 1][k] + dp[k + 1][j]);
}
}
}
for (int i = 0; i < len; i++)
ans[i] = dp[0][i];
for (int i = 0; i < len; i++){
if (s1[i] == s2[i])
ans[i] = ans[i - 1];
else
for (int j = 0; j < i; j++)
ans[i] = min(ans[i], ans[j] + dp[j + 1][i]);
}
printf("%d\n", ans[len - 1]);
}
return 0;
}