算法作业_26(2017.6.6第十六周)
2017-06-06 19:33
501 查看
583. Delete Operation for Two Strings
Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the
same, where in each step you can delete one character in either string.
Example 1:
思路:还是动态规划问题,求最长子序列,思路同上一篇:
public class Solution {
public int minDistance(String word1, String word2) {
int len1 = word1.length();
int len2 = word2.length();
if(len1==0)
return len2;
if(len2==0)
return len1;
int[][] dp = new int[len1+1][len2+1];
for(int i = 0 ; i<=len1;i++){
for(int j =0;j<=len2;j++){
if(i==0||j==0){
dp[i][j] = 0;
}else if(word1.charAt(i-1)==word2.charAt(j-1)){
dp[i][j] = dp[i-1][j-1] + 1;
}else{
dp[i][j] = Math.max(dp[i-1][j] , dp[i][j-1]);
}
}
}
int maxLength = dp[len1][len2];
return len1-maxLength+len2-maxLength;
}
}
Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the
same, where in each step you can delete one character in either string.
Example 1:
Input: "sea", "eat" Output: 2 Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
思路:还是动态规划问题,求最长子序列,思路同上一篇:
public class Solution {
public int minDistance(String word1, String word2) {
int len1 = word1.length();
int len2 = word2.length();
if(len1==0)
return len2;
if(len2==0)
return len1;
int[][] dp = new int[len1+1][len2+1];
for(int i = 0 ; i<=len1;i++){
for(int j =0;j<=len2;j++){
if(i==0||j==0){
dp[i][j] = 0;
}else if(word1.charAt(i-1)==word2.charAt(j-1)){
dp[i][j] = dp[i-1][j-1] + 1;
}else{
dp[i][j] = Math.max(dp[i-1][j] , dp[i][j-1]);
}
}
}
int maxLength = dp[len1][len2];
return len1-maxLength+len2-maxLength;
}
}
class Solution { public: int minDistance(string word1, string word2) { int len1 = word1.size(); int len2 = word2.size(); vector<vector<int>> dp (len1+1,vector<int>(len2+1)); for(int i = 0;i<=len1;i++){ for(int j = 0;j<=len2;j++){ if(i==0 || j==0){ dp[i][j] = 0; }else if(word1[i-1] == word2[j-1]){ dp[i][j] = dp[i-1][j-1] +1; }else{ dp[i][j] = max(dp[i-1][j],dp[i][j-1]); } } } return len1+len2-2*dp[len1][len2]; } };
相关文章推荐
- 算法作业_27(2017.6.8第十六周)
- 算法设计与结构基础作业第十六周
- 算法课第十六周作业 | Single Number
- 算法第十六周作业01
- 算法作业HW25:LeetCode 26. Remove Duplicates from Sorted Array
- [算法作业-动态规划][LeetCode] 97. Interleaving String
- 第二周作业 2.1: 判断一个正整数是否为质数的算法
- 短作业优先算法-SJF
- 算法作业_5(2017.3.7第三周)
- 算法设计期末作业-06-8.15
- 第四次作业 LBG矢量量化算法
- 算法设计作业8
- Java数据结构和算法-作业1-问题部分
- 第十六周作业 2.0
- 作业调度问题深度搜索定界算法
- 北航算法作业一 约瑟夫环问题
- 算法作业_25(2017.6.1第十五周)
- 算法设计与应用基础:第十六周(1)
- 去年的算法作业题_01背包_矩阵相乘
- 算法作业13