Edit Distance(dp)
来源:互联网 发布:mac迅雷界面看不见人物 编辑:程序博客网 时间:2024/06/06 03:48
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题
Use f[i][j] to represent the shortest edit distance between word1[0,i) and word2[0, j). Then compare the last character of word1[0,i) and word2[0,j), which are c and d respectively (c == word1[i-1], d == word2[j-1]):
if c == d, then : f[i][j] = f[i-1][j-1]
Otherwise we can use three operations to convert word1 to word2:
(a) if we replaced c with d: f[i][j] = f[i-1][j-1] + 1;
(b) if we added d after c: f[i][j] = f[i][j-1] + 1;
(c) if we deleted c: f[i][j] = f[i-1][j] + 1;
class Solution {public: int minDistance(string word1, string word2) { int m=word1.size(); int n=word2.size(); int dp[m+1][n+1]; dp[0][0]=0; for (int i = 1; i <= m; i++) dp[i][0] = i; for (int j = 1; j <= n; j++) dp[0][j] = j; for(int i=1;i<=m;i++) for(int j=1;j<=n;j++){ int c=word1[i-1]; int d=word2[j-1]; if(d==c)dp[i][j]=dp[i-1][j-1]; else { dp[i][j]=min(min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1])+1; } } return dp[m][n]; }};
- 4.Edit Distance【dp】
- 【DP】Edit Distance
- Leetcode dp Edit Distance
- [leetcode][DP] Edit Distance
- LeetCode Edit Distance DP
- [LeetCode] Edit Distance(!!!!!DP)
- Edit Distance(dp)
- Edit Distance(dp)
- leetcode---edit-distance---dp
- Leetcode-Edit Distance(dp)
- 72:Edit Distance【DP】【字符串】
- leetcode -- Edit Distance -- 重点dp
- leetcode 72. Edit Distance DP
- [LeetCode] DP 之 Edit Distance
- 【DP】 Shortest Edit Distance in C
- POJ 3356 AGTC(经典DP Edit Distance)
- 72. Edit Distance 动态规划dp
- Leetcode 72 Edit Distance DP好题
- 【MongoDB】MongoDB的安装与入门
- 紧急的测试任务怎么办?
- linux设置服务为自动启动和关闭并禁用的命令
- Server Tomcat v7.0 Server at localhost was unable to start within 45 seconds
- NIO selector原理浅析
- Edit Distance(dp)
- 【整理】负载测试、压力测试、性能测试的区别
- 使用JDBCTemplate实现与Spring结合,方法公用 ——Emp实现类(EmpDaoImpl)
- android入门(五大布局)
- python2.7中文编码
- 修改树状控件TreeCtrl的节点名称
- 第六次上机作业Define a concrete class intset&&EOJ2853
- 20170315 c++上机作业—两个类的交互
- 查看APK的签名信息