LeetCode 72. Edit Distance

参考链接：https://zxi.mytechroad.com/blog/dynamic-programming/leetcode-72-edit-distance/
思路：

Solution1：
递归

// Author: Huahua
// Runtime: 13 ms
class Solution {
public:int minDistance(string word1, string word2) {int l1 = word1.length();int l2 = word2.length();d_ = vector<vector<int>>(l1 + 1, vector<int>(l2 + 1, -1));return minDistance(word1, word2, l1, l2);}
private:vector<vector<int>> d_;// minDistance from word1[0:l1-1] to word2[0:l2-1]int minDistance(const string& word1, const string& word2, int l1, int l2) {if (l1 == 0) return l2;if (l2 == 0) return l1;if (d_[l1][l2] >= 0) return d_[l1][l2];int ans;if (word1[l1 - 1] == word2[l2 - 1])ans = minDistance(word1, word2, l1 - 1, l2 - 1);else ans = min(minDistance(word1, word2, l1 - 1, l2 - 1),min(minDistance(word1, word2, l1 - 1, l2), minDistance(word1, word2, l1, l2 - 1))) + 1;return d_[l1][l2] = ans;        }
};

Solution2：
迭代

// Author: Huahua
// Runtime: 9 ms
class Solution {
public:int minDistance(string word1, string word2) {int l1 = word1.length();int l2 = word2.length();// d[i][j] := minDistance(word1[0:i - 1], word2[0:j - 1]);vector<vector<int>> d(l1 + 1, vector<int>(l2 + 1, 0));for (int i = 0; i <= l1; ++i)d[i][0] = i;for (int j = 0; j <= l2; ++j)d[0][j] = j;for (int i = 1; i <= l1; ++i)for (int j = 1; j <= l2; ++j) {int c = (word1[i - 1] == word2[j - 1]) ? 0 : 1;d[i][j] = min(d[i - 1][j - 1] + c, min(d[i][j - 1], d[i - 1][j]) + 1);}return d[l1][l2];}
};

PS：花花真牛逼。。。

【重点！记忆化递归+DP】LeetCode 72. Edit Distance相关推荐

LeetCode 87. 扰乱字符串（记忆化递归 / DP）
文章目录 1. 题目 2. 解题 2.1 记忆化递归 2.2 动态规划 1. 题目给定一个字符串 s1,我们可以把它递归地分割成两个非空子字符串,从而将其表示为二叉树. 下图是字符串 s1 = &q ...
LeetCode 514. 自由之路（记忆化递归 / DP）
文章目录 1. 题目 2. 解题 1. 题目电子游戏"辐射4"中,任务"通向自由"要求玩家到达名为"Freedom Trail Ring" ...
【记忆化递归+DP】LeetCode 139. Word Break
LeetCode 139. Word Break Solution1: 记忆化递归的典型套路题参考网址:https://zxi.mytechroad.com/blog/leetcode/leetco ...
【DFS + 记忆化递归 + DP】LeetCode 91. Decode Ways
LeetCode 91. Decode Ways Solution1:我的答案还是记录一下,最容易想到的是DFS,但是在第223/238个case上就超时了... class Solution { ...
【DFS + 记忆化递归】LeetCode 140. Word Break II
LeetCode 140. Word Break II Solution1:我的答案纯DFS,在第31个case时超时,还是记录一下.. class Solution { // DFS public ...
LeetCode(72)Edit Distance
题目 Given two words word1 and word2, find the minimum number of steps required to convert word1 to wo ...
[leetcode] 72.Edit Distance 编辑距离-史前最简明清晰的解答
题目: 给定两个单词 word1 和 word2,计算出将 word1 转换成 word2 所使用的最少操作数 . 你可以对一个单词进行如下三种操作: 插入一个字符删除一个字符替换一个字符输入: ...
【重点！DFS/记忆化递归 + BFS】LeetCode 133. Clone Graph
LeetCode 133. Clone Graph Solution1: DFS/记忆化递归,参考网址:http://www.cnblogs.com/grandyang/p/4267628.html ...
LeetCode 337. 打家劫舍 III（记忆化+递归）
文章目录 1. 题目 1.1 相关题目: 2. 解题 2.1 递归 2.2 记忆化递归 1. 题目在上次打劫完一条街道之后和一圈房屋后,小偷又发现了一个新的可行窃的地区.这个地区只有一个入口,我们称 ...

【重点！记忆化递归+DP】LeetCode 72. Edit Distance

LeetCode 72. Edit Distance

【重点！记忆化递归+DP】LeetCode 72. Edit Distance相关推荐

最新文章

热门文章