原串(增删改)变成目标串
// dp[i][j]表示源串S[0..i]和目标串target[0..j]的编辑距离
int EditDistance(char *S, char *T)
{
int srcLength = strlen(S);
int targetLength = strlen(T);
int i, j;
// 边界dp[i][0] = i, dp[0][j] = j
for (i = 1; i <= srcLength; ++i)
{
dp[i][0] = i;
}
for (j = 1; j <= targetLength; ++j)
{
dp[0][j] = j;
}
for (i = 1; i <= srcLength; ++i)
{
for (j = 1; j <= targetLength; ++j)
{
if (S[i - 1] == T[j - 1])
{
dp[i][j] = dp[i - 1][j - 1];
}
else
{
dp[i][j] = 1 + min(dp[i - 1][j], dp[i][j - 1]);
}
}
}
return dp[srcLength][targetLength];
}
十一:字符串编辑距离
猜你喜欢
转载自blog.csdn.net/ndzjx/article/details/84839492
今日推荐
周排行