🌗 72. 编辑距离

难度: 🌗

• 问题描述
• 解法
• 输出

问题描述

---

解法

class Solution {
    public int minDistance(String word1, String word2) {
        // 思路：
        // dp[i][j] = dp[i - 1][j - 1], [i] == [j]
        // dp[i][j] = min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]) + 1
        int rows = word1.length();
        int cols = word2.length();
        int[][] dp = new int[rows + 1][cols + 1];
        // 初始化
        for(int i = 0; i <= rows; i ++) {
            dp[i][0] = i;
        }
        for(int j = 0; j <= cols; j ++) {
            dp[0][j] = j;
        }
        // dp
        for(int i = 1; i <= rows; i ++) {
            for(int j = 1; j <= cols; j ++) {
                int m = i - 1;
                int n = j - 1;
                if(word1.charAt(m) == word2.charAt(n)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = Math.min(dp[i - 1][j], Math.min(dp[i][j - 1], dp[i - 1][j - 1])) + 1;
                }
            }
        }
        return dp[rows][cols];
    }
}

---

输出