72. Edit Distance

最短编辑距离

题目描述

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
You have the following 3 operations permitted on a word:
Insert a character
Delete a character
Replace a character

输入输出示例

Input: word1 = "horse", word2 = "ros"
Output: 3
Explanation: 
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

思路

参考文章https://blog.csdn.net/baodream/article/details/80417695

新建一个数组dp[word1.length+1][word.length+1]
考虑word1的第i个位置和word2的的第j个位置，即两个字符串的长度为i和j时

• 如果word1[i]和word2[j]相等，dp[i][j]=dp[i-1][j-1]
• 如果word1[i]和word2[j]不相等
  • 修改word2[j]的值，使之与word1[i]的值相等，则dp[i][j]=dp[i-1][j-1]+1
  • 在word2[j]后插入字符，使之与word1[i]的值相等，则dp[i][j]=dp[i-1][j]+1
  • 在word2[j]处删除字符，dp[i][j]=dp[i][j-1]+1

java代码

class Solution {
   public int minDistance(String word1, String word2) {
       int len1 = word1.length();
       int len2 = word2.length();
       int[][] dp = new int[len1+1][len2+1];
       for (int i=1;i<=len1;i++)
           dp[i][0] = i;
       for (int j=1;j<=len2;j++)
           dp[0][j] = j;
       for (int i=1;i<=len1;i++){
           for (int j=1;j<=len2;j++){
               int change;
               if (word1.charAt(i-1)==word2.charAt(j-1))
                   change = 0;
               else
                   change = 1;
               dp[i][j] = Math.min(dp[i-1][j-1]+change, Math.min(dp[i-1][j]+1, dp[i][j-1]+1));
           }
       }
       return dp[len1][len2];
   }
}