来源:http://blog.csdn.net/juststeps/article/details/9207187
先是考虑将所有与目标字符串不相同的刷成目标串:
dp[i][j]表示刷i-j区间,
初始条件:dp[i][j]=dp[i+1][j]+1;
对于k=(i+1...j )如果str[k]==str[i],则dp[i][j]=min(dp[i][j],dp[i+1][k]+dp[k+1][j]),,因为刷i的时候可以与k同时刷。
上面是对初始串与目标串完全不同的情况,
如果有部分的不同:
ans[i]表示将str1[0...i]刷成str2[0...i]的最小步数,
if str1[i]==str2[i] 则ans[i]=ans[i-1];
else
ans[i]=min(ans[i],ans[j]+dp[j+1][i]) j<i;
AC代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
inline int min( int a, int b ){
return ( a < b ? a : b );
}
int main(){
char s1[101], s2[101];
int dp[101][101], length, ans[101];
while( scanf( "%s%s", s1, s2 ) != EOF ){
length = strlen( s1 );
memset( dp, 0, sizeof( dp ) );
for( int i = 0; i < length; i++ ){
for( int j = i; j < length; j++ ){
dp[i][j] = j - i + 1;
}
}
for( int j = 0; j < length; j++ ){
for( int i = j - 1; 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 < length; i++ ){
ans[i] = dp[0][i];
if( s1[i] == s2[i] ){
if( i == 0 ){
ans[i] = 0;
}else{
ans[i] = ans[i-1];
}
}else{
for( int k = i - 1; k >= 0; k-- ){
ans[i] = min( ans[i], ans[k] + dp[k+1][i] );
}
}
}
cout << ans[length-1] << endl;
}
return 0;
}