class Solution {
public int minDistance(String word1, String word2) {
int m = word1.length(),n = word2.length();
int[][] dp = new int[m+1][n+1];
for(int i = 1;i <= m;i++)
dp[i][0] = i;
for(int j = 1;j <= n;j++)
dp[0][j] = j;
for(int i = 1;i <= m;i++){
for(int j = 1;j <= n;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][j-1],Math.min(dp[i-1][j],dp[i-1][j-1])) + 1;
}
}
return dp[m][n];
}
}
05-18
245
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-26
641
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-06
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交