class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int>> dp(word1.length() + 1, vector<int>(word2.length() + 1, 0));
for(int i = 1; i <= word1.length(); i++){
dp[i][0] = i;
}
for(int j = 1; j <= word2.length(); j++){
dp[0][j] = j;
}
for(int i = 1; i <= word1.length(); i++){
for(int j = 1; j <= word2.length(); j++){
if(word1[i - 1] == word2[j - 1])
dp[i][j] = dp[i - 1][j - 1];
else{
int tempMin1 = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
dp[i][j] = min(tempMin1, dp[i - 1][j - 1] + 1);
}
}
}
return dp[word1.length()][word2.length()];
}
};
LeetCode72. 编辑距离
于 2024-07-25 09:55:30 首次发布