【LeetCode】72. Edit Distance单词变换的最少操作

问题描述

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)

You have the following 3 operations permitted on a word:

a) Insert a character
b) Delete a character
c) Replace a character

---

经典DP问题。
dp[i][j]：表示从s1[0…i-1] 变到 s2[0…j-1]所需要的最少操作次数，其中可以看出i,j≥1。

1. 初始化：考虑边界情况，当有一个单词是空字符时，则dp[i][0] = i，dp[0][j] = j 。

2. 子问题：从s1[0..i - 2] 变到 s2[0..j - 2]，即 dp[i-1][j-1]
   当s1[i-1] = s2[j-1]时，dp[i][j] = dp[i-1][j-1]；
   当s1[i-1] ≠ s2[j-1]时，进行3种操作中的某一种使得最后两个字母相同：
   （1）替换操作：用s2最后的字母替换s1最后的字母，dp[i][j] = dp[i - 1][j - 1] + 1
   （2）删除操作：删除s1最后一个字母，使得最后字母相同，dp[i][j] = dp[i - 1][j] + 1
   ࿰