leetcode 72. Edit Distance
来源:互联网 发布:淘宝商务男装品牌 编辑:程序博客网 时间:2024/06/09 16:44
72. Edit Distance
方法:
1. 动态规划方法
2. dp[i][j] 表示word1前i个字符转到word2前j个字符所需的步骤
3. 如果word1.charAt(i) == word2.charAt(j) dp[i][j] == dp[i - 1][j - 1];, 否则dp[i][j] = 1 + min(dp[i][j - 1], dp[i - 1][j], dp[i - 1][j - 1]),其中dp[i][j - 1] = 表示用插入操作, dp[i - 1][j]表示用删除操作,dp[i - 1][j - 1] 表示用替换操作。
4. dp初始化dp[0, k] = dp [k , 0] = k。
代码:
public class Solution { public int minDistance(String word1, String word2) { int m = word1.length(); int n = word2.length(); int[][] matrix = new int[m + 1][n + 1]; for(int i = 0; i <= m; i++){ matrix[i][0] = i; } for(int i = 0; i <= n; i++){ matrix[0][i] = i; } for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ if(word1.charAt(i) == word2.charAt(j)){ matrix[i + 1][j + 1] = matrix[i][j]; } else{ int a = matrix[i + 1][j]; int b = matrix[i][j + 1]; int c = matrix[i][j]; int min = Math.min(a, b); matrix[i + 1][j + 1] = Math.min(min, c) + 1; } } } return matrix[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
- HDU6109 数据分割 【并查集+启发式】
- 在QGraphicsScene中限制图元的拖动范围
- Eclipse+Maven搭建Struts2+Spring+Hibernate项目
- ar
- 说说makefile那些事
- leetcode 72. Edit Distance
- 多线程的全局变量与局部变量
- 用Python满足满足自己的“小虚荣”
- [简单逻辑学]学习逻辑学的思想准备——观念联系事实
- SELinux
- python数学计算模块之math常用函数学习使用
- mysql数据库连接的最原始的方式
- Zigbee之TICC2530开发笔记(1)
- 【贪心】CodeChef(PROTEPOI)[Protecting The Poison]题解