LeetCode 72. Edit Distance
来源:互联网 发布:腾讯游戏平台mac版本 编辑:程序博客网 时间:2024/06/05 18:46
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]表示word1[0…i]和word2[0…j]的最小编辑距离。
如果word1为空,则删除word2中元素
如果word2为空,则删除word1中元素
都不为空,有三种选择:
1)删除word1的最后一个字符,此时dp[i-1][j] + 1
2) 删除word2的最后一个字符,此时dp[i][j-1] + 1
3) word1最后一个替换为word2最后一个 , 则dp[i-1][j-1] + (word1[i] != word2[j])(下标从1开始)
代码如下:
class Solution {public: int minDistance(string word1,string word2) { int m = word1.length(); int n = word2.length(); int dp[m+1][n+1]; memset(dp,0,sizeof(dp)); 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++) { int num ; if(word1[i-1] == word2[j-1]) num = 0; else num = 1; dp[i][j] = min(dp[i-1][j] + 1, min(dp[i][j-1] + 1, dp[i-1][j-1] + num) ); } } return dp[m][n]; }};
阅读全文
0 0
- LeetCode 72. Edit Distance
- [LeetCode]72.Edit Distance
- LeetCode --- 72. Edit Distance
- [Leetcode] 72. Edit Distance
- [leetcode] 72.Edit Distance
- [leetcode] 72.Edit Distance
- Leetcode 72. Edit Distance
- LeetCode 72. Edit Distance
- leetcode 72. Edit Distance
- LeetCode 72. Edit Distance
- Leetcode 72. Edit Distance
- Leetcode:72. Edit Distance
- 【LeetCode】72. Edit Distance
- leetCode 72. Edit Distance
- [leetcode] 72. Edit Distance
- [LeetCode] 72. Edit Distance
- leetcode 72. Edit Distance
- leetcode 72. Edit Distance
- Html 基础学习系列一 标签img
- visual studio 2015 密钥
- Java软件工程师面试题汇总(持续更新)
- How to set JAVA_HOME on mac
- 最小距离分类法介绍
- LeetCode 72. Edit Distance
- Spring Aop(一)——Aop简介
- HDU 1215 七夕节
- HTML知识整理
- Sobel算子及C++实现
- 一个安卓工程师学习后台的经历《一》ide选择篇
- 51Nod 1022(四边形优化dp)
- HDOJ2018
- 16进制转10进制使用霍纳算法(java版)