Day 5:583 两个字符串的删除操作

1. 题目描述

583 两个字符串的删除操作

2. 解题思路

动态规划的思想:
(1) 记f[i][j]为表示使word1[0:i]、word2[0:j]相同的最少删除次数；
(2) 当i=0或j=0时，动态规划的边界表达式如下所示:
$$\begin{gathered} f[i][0]=i,\text{if }0\le i\le n_1 \\ f[0][j]=j,\text{if }0\le j\le n_2 \end{gathered}$$
(3) 当i>0且j>0时，动态规划的表达式如下所示:
$$f[i][j]=\{\begin{array}{ll}f[i-1][j-1],& \text{if }word1[i-1]=word2[j-1]\\ \min (f[i-1][j],f[i][j-1])+1,& \text{if }word1[i-1]\ne word2[j-1]\end{array}$$
可以利用1143 最长公共子序列逆向求解。

3. 代码实现

class Solution {
public:
    int minDistance(string word1, string word2) {
        int n1 = word1.size();
        int n2 = word2.size();
        vector<vector<int>> f(n1 + 1, vector<int>(n2 + 1));
        for (int i = 1; i <= n1; i++) {
            f[i][0] = i;
        }
        for (int j = 1; j <= n2; j++) {
            f[0][j] = j;
        }
        for (int i = 1; i <= n1; i++) {
            for (int j = 1; j <= n2; j++) {
                if (word1[i - 1] == word2[j - 1]) {
                    f[i][j] = f[i - 1][j - 1];
                } else {
                    f[i][j] = min(f[i - 1][j], f[i][j - 1]) + 1;
                }
            }
        }
        return f[n1][n2];
    }
};