LeetCode--Edit Distance
来源:互联网 发布:威廉·密里根 知乎 编辑:程序博客网 时间:2024/05/22 11:39
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
思路:动态规划法。
这是一个很好的二维动态规划问题,状态之间只存在一步转换,考虑dp[i][j]表示长度为i的word1转换到长度为j的word2话,有两种情况:
word1[i-1]==word2[j-1],dp[i][j]=dp[i-1][j-1];
word1[i-1]!=word2[j-1],min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1.
注意初始化就是一直插入和删除就好了。
class Solution {public: int minDistance(string word1, string word2) { int m=word1.size(),n=word2.size(); int dp[m+1][n+1]; dp[0][0]=0; for(int i=0;i<=m;i++){ dp[i][0]=i; } for(int i=0;i<=n;i++){ dp[0][i]=i; } for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ if(word1[i-1]==word2[j-1]) dp[i][j]=dp[i-1][j-1]; else dp[i][j]=min(dp[i-1][j],min(dp[i][j-1],dp[i-1][j-1]))+1; } } return dp[m][n]; }};
阅读全文
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
- 【数据库设计】概念设计-数据库ER图基础概念
- RxJava+RxAndroid+OKHTTP实现get post 以及下载图片功能
- Frequent Subsets Problem 进制运算 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- 暗通道去雾算法 python实现
- kami
- LeetCode--Edit Distance
- Android常用的动画和小型代码理解
- ssh整合测试
- 一串数字分区间显示
- VS SDK更新问题(error MSB8036: 找不到 Windows SDK 版本10.0.14393.0)
- MATLAB中处理边界的函数
- mvc框架上传文件-1
- Java基础(二)运算符
- 数字黑洞 (20)