LeetCode 72. 编辑距离
使用动态规划
代码实现:
class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int>> dp(word1.size() + 1, vector<int>(word2.size() + 1, 0));//初始化
for (int i = 0; i < word1.size() + 1; ++i) dp[i][0] = i;//word2为空的情况
for (int j = 0; j < word2.size() + 1; ++j) dp[0][j] = j;//word1为空的情况
for (int i = 1; i <= word1.size(); ++i) {
for (int j = 1; j <= word2.size(); ++j) {
dp[i][j] = min(dp[i][j - 1], min(dp[i - 1][j], dp[i - 1][j - 1])) + 1;
if (word1[i - 1] == word2[j - 1]) {
dp[i][j] = min(dp[i][j], dp[i - 1][j - 1]);
}
}
}
return dp.back().back();
}
};