LeetCode: Edit Distance
来源:互联网 发布:网络舆情应急预案 编辑:程序博客网 时间:2024/06/06 01:47
思路:很经典的动态规划方法,练练手,实现的速度还可以,注意下标的选择问题(我是没有选好,挂了一次)
class Solution {public: int minDistance(string word1, string word2) {int len1 = word1.length(), len2 = word2.length();int ** f = new int* [len1+1];for(int i = 0;i < len1+1;i++)f[i] = new int[len2+1];for(int i =0;i<len1+1;i++)f[i][0] = i;for(int j=0;j<len2+1;j++)f[0][j] = j;for(int i=1;i<=len1;i++)for(int j=1;j<=len2;j++){if(word1[i-1] == word2[j-1])f[i][j] = f[i-1][j-1];elsef[i][j] = min(min(f[i-1][j],f[i][j-1]),f[i-1][j-1]) + 1;}return f[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
- 一、小贝学习cocos2dx——windows环境搭建
- s当过兵v不会太难进软件和人员合同法国和地方广泛地
- hibernate关联关系之多对多关系
- 全自动pdf转word转换器独家发布
- 岁月号沉没:大型灾难考验国家伦理
- LeetCode: Edit Distance
- BZOJ 1010 单调队列优化dp
- android对话框(Dialog)的用法
- 双向冒泡排序
- 如何解决安卓SDK无法下载Package的问题
- java实现栈(数组和链表两种实现方式)
- nyoj 115 城市平乱
- 专家解析:程序员到软件架构师培训与认证之路
- 蛇形数组