本实现用了leet code 推荐的算法:动态规划
/*
给你两个单词 word1 和 word2, 请返回将 word1 转换成 word2 所使用的最少操作数 。
你可以对一个单词进行如下三种操作:
插入一个字符
删除一个字符
替换一个字符
示例 1:
输入:word1 = "horse", word2 = "ros"
输出:3
解释:
horse -> rorse (将 'h' 替换为 'r')
rorse -> rose (删除 'r')
rose -> ros (删除 'e')
示例 2:
输入:word1 = "intention", word2 = "execution"
输出:5
解释:
intention -> inention (删除 't')
inention -> enention (将 'i' 替换为 'e')
enention -> exention (将 'n' 替换为 'x')
exention -> exection (将 'n' 替换为 'c')
exection -> execution (插入 'u')
提示:
0 <= word1.length, word2.length <= 500
word1 和 word2 由小写英文字母组成
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/edit-distance
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
static inline int min(int a, int b, int c)
{
int ret = a;
if (b < ret)
ret = b;
if (c < ret)
ret = c;
return ret;
}
int minDistance(char * word1, char * word2)
{
int len_1 = strlen(word1) + 1;
int len_2 = strlen(word2) + 1;
int i, j, min_dist = 0;
int **dp = (int **)malloc(len_1 * sizeof(int *));
for (i = 0; i < len_1; i++) {
dp[i] = (int *)malloc(len_2 * sizeof(int));
}
//pre-insert $ to word1 and word2, to handle dp 0 row and 0 column
for (i = 0; i < len_1; i++) {
dp[i][0] = i;
}
for (i = 0; i < len_2; i++) {
dp[0][i] = i;
}
// to handle word1 an word2
for (i = 1; i < len_1; i++) {
for (j = 1; j < len_2; j++) {
if (word1[i-1] == word2[j-1]) {
dp[i][j] = dp[i-1][j-1];
} else {
dp[i][j] = min(dp[i-1][j-1], dp[i][j-1], dp[i-1][j]) + 1;
}
}
}
min_dist = dp[len_1 - 1][len_2 - 1];
for (i = 0; i < len_1; i++) {
free(dp[i]);
}
free(dp);
return min_dist;
}
int main(int argc, char *argv[])
{
if (argc != 3) {
printf("To find min-dist of two strings, please input two strings!\n");
return 0;
}
printf("%d\n", minDistance(argv[1], argv[2]));
return 0;
}