leetcode - Edit Distance
来源:互联网 发布:淘宝网婴儿大pp裤 编辑:程序博客网 时间:2024/06/06 09:59
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(std::string word1, std::string word2) {int len1 = word1.size(),len2 = word2.size();if(len1 == 0 || len2 == 0) return std::max(len1,len2); std::vector<std::vector<int>> dp(len1+1,std::vector<int>(len2+1,0));for (int i = 0; i <= len1; i++){dp[i][0] = i;}for (int i = 0; i <= len2; i++){dp[0][i] = i;}for (int i = 1; i <= len1; i++){for (int j = 1; j <= len2; j++){if(word1[i-1] == word2[j-1]){dp[i][j] = dp[i-1][j-1];}else{dp[i][j] = std::min(dp[i-1][j-1],std::min(dp[i-1][j],dp[i][j-1])) + 1;}}}return dp[len1][len2]; }};
0 0
- LeetCode: Edit Distance
- LeetCode Edit Distance
- LeetCode: Edit Distance
- [Leetcode] Edit Distance
- leetcode 19: Edit Distance
- [LeetCode] Edit Distance
- [Leetcode] Edit Distance
- LeetCode Edit Distance
- [LeetCode] Edit Distance
- [LeetCode]Edit Distance
- Leetcode: Edit Distance
- [leetcode]Edit Distance
- LeetCode-Edit Distance
- [leetcode] Edit Distance
- LeetCode - Edit Distance
- leetcode之Edit Distance
- leetcode edit distance
- 【leetcode】Edit Distance
- Python的测试
- 抓取菜谱保存到本地
- JNI学习积累之三 ---- 操作JNI函数以及复杂对象传递
- 第四周工作总结
- 《Linux程序设计》——POSIX线程
- leetcode - Edit Distance
- backbone>>collection
- jquery横向滑屏滚动
- java httpURL连接远程服务器并返回数据(httpurlconnection)
- backbone>>router
- vmware 下 Fedora 20装vmware tools 遇到的问题及解决
- C语言-typedef
- 从头到尾彻底理解KMP
- 使用ant 批量打包app