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{
int transfer = dp[i - 1][j - 1] + 1;
int addAndDel = Math.min(dp[i - 1][j] + 1,dp[i][j - 1] + 1);
dp[i][j] = Math.min(transfer,addAndDel);
}
}
}
return dp[word1.length()][word2.length()];
}
}
72. 编辑距离
最新推荐文章于 2024-07-29 18:00:00 发布