编辑距离

递归法

int editDistance(string &word1, string &word2, int i, int j) {
    if (i == -1)return j + 1;
    if (j == -1)return i + 1;
    if (word1[i] == word2[j])return editDistance(word1, word2, i - 1, j - 1);
    return 1 + min(min(editDistance(word1, word2, i - 1, j - 1), editDistance(word1, word2, i, j - 1)),
                   editDistance(word1, word2, i - 1, j));
}

int minDistance(string word1, string word2) {
    return editDistance(word1, word2, word1.length() - 1, word2.length() - 1);
}

动态规划

int editingDistanceDp(string word1, string word2) {
    int i, j, m = word1.length(), n = word2.length();
    vector<vector<int>> dp(m + 1, vector<int>(n + 1));
    for (j = 0; j <= n; ++j)dp[0][j] = j;
    for (i = 0; i <= m; ++i)dp[i][0] = i;
    for (i = 1; i <= m; ++i) {
        for (j = 1; j <= n; ++j) {
            if (word1[i - 1] == word2[j - 1])dp[i][j] = dp[i - 1][j - 1];
            else dp[i][j] = 1 + min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1]));
        }
    }
    return dp[m][n];
}