LeetCode刷题(C++)——Edit Distance(Hard)
来源:互联网 发布:三年经验程序员薪资 编辑:程序博客网 时间:2024/06/15 22:11
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitted on a word:
a) Insert a character
b) Delete a character
c) Replace a character
class Solution {public: int minDistance(string word1, string word2) {int m = word1.length(), n = word2.length();vector<vector<int>> dp(m + 1, vector<int>(n + 1));for (int i = 0; i <= m;++i) {for (int j = 0; j <= n;++j) {if (i == 0) {dp[i][j] = j;}else if (j == 0) {dp[i][j] = i;}else {dp[i][j] = min(dp[i - 1][j - 1] + ((word1[i - 1] == word2[j - 1]) ? 0 : 1),min(dp[i][j - 1] + 1, dp[i - 1][j] + 1));}}}return dp[m][n]; }};
0 1
- LeetCode刷题(C++)——Edit Distance(Hard)
- (Leetcode)72. Edit Distance(hard)
- 第九周 leetcode 72. Edit Distance(Hard)
- Edit Distance(LeetCode)
- 算法分析与设计丨第十周丨LeetCode(14)——Edit distance(Hard)
- LeetCode刷题(37)--Edit Distance
- 【leetcode】String——Edit Distance(72)
- LeetCode 72 — Edit Distance(C++ Python)
- LeetCode —— Edit Distance
- leetcode——Edit Distance
- LeetCode—72.Edit Distance
- LeetCode(72) Edit Distance
- Leetcode 72. Edit Distance (Hard) (cpp)
- 动态规划——72. Edit Distance[HARD]
- [leetcode-72]Edit Distance(C)
- Edit Distance----hard
- 72. Edit Distance Hard
- leetcode 072 —— Edit Distance
- Java笔试题解(5)
- 汇编语言作业
- MySQL增删查改知识点
- dao--3.事务
- Unity基础.006游戏中的用户界面(UI)
- LeetCode刷题(C++)——Edit Distance(Hard)
- Js中的prototype和__proto__
- php慢日志和mysql慢日志
- Java String
- Effective Java读书笔记(目录)
- 程序员必读书单
- vector容器学习
- IO模型基础知识
- NT驱动加载与卸载