求两个字符串的最短编辑距离:
s1 = "GUMBO";
s2 = "GAMBOL";
动态规划思想:
c[i][j] = min( c[i-1][j] +1, c[i][j-1] +1, c[i-1][j-1] + cost)
分别表示:删掉一个字符,增加一个字符,替换一个字符。
#include <stdlib.h>
char t[] = "GUMBO";
char s[] = "GAMBOL";
int c[100][100];
int min(int a, int b)
{
return a < b ? a : b;
}
void find(char *s, char *t)
{
int len1 = strlen(s);
int len2 = strlen(t);
int i, j;
for(i = 0; i <= len1; i++)
{
c[i][0] = i;
}
for(i = 0; i <= len2; i++)
{
c[0][i] = i;
}
for(i = 1; i < len1; i++)
{
for(j = 1; j < len2; j++)
{
int cost = s[i] == t[j] ? 0 : 1;
c[i][j] = min(c[i - 1][j] + 1, c[i][j - 1] + 1);
c[i][j] = min(c[i][j], c[i-1][j-1] + cost);
}
}
for(i = 0; i < len1; i++)
{
for(j = 0; j< len2; j++)
{
printf(" %d ", c[i][j]);
}
printf("\n");
}
printf("%d", c[len1-1][len2-1]);
}
int main()
{
find(s,t);
}