zoukankan      html  css  js  c++  java
  • LC 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:

    Input: "sea", "eat"
    Output: 2
    Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
    

    Note:

    1. The length of given words won't exceed 500.
    2. Characters in given words can only be lower-case letters.
     

    Runtime: 40 ms, faster than 95.62% of Java online submissions for Delete Operation for Two Strings.

    largest subsequence

    class Solution {
      public int minDistance(String word1, String word2) {
        int[][] dp = new int[word1.length()+1][word2.length()+1];
        for(int i=1; i<dp.length; i++){
          for(int j=1; j<dp[0].length; j++){
            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]);
            }
          }
        }
        return word1.length() + word2.length() - 2 * dp[word1.length()][word2.length()];
      }
    }
  • 相关阅读:
    链表的常用操作
    android简易论坛的制作
    Bmob后端云的使用
    马哥第九周
    马哥第八周
    马哥第七周
    马哥第六周
    马哥第五周
    马哥第四周
    马哥第三周
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10263659.html
Copyright © 2011-2022 走看看