class Solution {
public int minDistance(String word1, String word2) {
int[][] dp = new int[word1.length() + 1][word2.length() + 1];
for(int i = 0; i < word1.length() + 1;i++) dp[i][0] = i;
for(int i = 0; i < word2.length() + 1;i++) dp[0][i] = i;
for(int i = 1;i < word1.length() + 1;i++){
for(int j = 1;j < word2.length() + 1;j++){
if(word1.charAt(i - 1) == word2.charAt(j - 1)) dp[i][j] = dp[i - 1][j - 1];
else dp[i][j] = Math.min(dp[i - 1][j] + 1,dp[i][j - 1] + 1);
}
}
return dp[word1.length()][word2.length()];
}
}
dp[i][j] 就是字符串以 i - 1, j - 1字母结尾时,相同需要的最小步数,当不相等时,可以为上或者左步骤+ 1,取最小值。(灵感来了挡也挡不住)