Leetcode 72. Edit Distance
来源:互联网 发布:快手视频解析软件 编辑:程序博客网 时间:2024/06/18 18:29
问题描述
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的前i个字符与word2前j个字符匹配需要的最少操作次数。
状态转移方程:
if word1[i]==word2[j] dp[i][j]=dp[i-1][j-1]
if word1[i]!=word2[j] dp[i][j]=min(dp[i-1][j-1],dp[i-1][j],dp[i][j-1])
代码如下:
public int minDistance(String word1, String word2) { if(word1==null&&word2==null||word1.equals(word2)) return 0; if(word1.length()==0) return word2.length(); if(word2.length()==0) return word1.length(); int[][]dp=new int[word1.length()+1][word2.length()+1]; for(int i=0;i<=word1.length();i++){ dp[i][0]=i; } for(int j=0;j<=word2.length();j++){ dp[0][j]=j; } for(int i=1;i<=word1.length();i++){ for(int j=1;j<=word2.length();j++){ if(word1.charAt(i-1)==word2.charAt(j-1)) dp[i][j]=dp[i-1][j-1]; else dp[i][j]=Math.min(dp[i-1][j],Math.min(dp[i][j-1],dp[i-1][j-1]))+1; } } return dp[word1.length()][word2.length()]; }
阅读全文
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
- Spring学习笔记(一)
- React基础
- 终结解决Java Web开发过程中的中文乱码问题
- leetcode题解 632. Smallest Range
- Java并发编程:volatile关键字解析
- Leetcode 72. Edit Distance
- Keepalived的安装和配置
- linux-centos-创建虚拟机
- Linux操作系统管理技术(二)
- nodejs调试命令
- 1001. A+B Format (20)
- Numpy基础笔记
- 利用Tampermonkey chrome插件写脚本抢课以及交大选课插件
- 跟我开始从0学Android--写在前面