zoukankan      html  css  js  c++  java
  • 712. Minimum ASCII Delete Sum for Two Strings

    Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.

    Example 1:

    Input: s1 = "sea", s2 = "eat"
    Output: 231
    Explanation: Deleting "s" from "sea" adds the ASCII value of "s" (115) to the sum.
    Deleting "t" from "eat" adds 116 to the sum.
    At the end, both strings are equal, and 115 + 116 = 231 is the minimum sum possible to achieve this.
    

    Example 2:

    Input: s1 = "delete", s2 = "leet"
    Output: 403
    Explanation: Deleting "dee" from "delete" to turn the string into "let",
    adds 100[d]+101[e]+101[e] to the sum.  Deleting "e" from "leet" adds 101[e] to the sum.
    At the end, both strings are equal to "let", and the answer is 100+101+101+101 = 403.
    If instead we turned both strings into "lee" or "eet", we would get answers of 433 or 417, which are higher.

    Note:

    • 0 < s1.length, s2.length <= 1000.
    • All elements of each string will have an ASCII value in [97, 122].

    Approach #1: DFS + Memeory. [C++]

    class Solution {
    public:
        int minimumDeleteSum(string s1, string s2) {
            int l1 = s1.length();
            int l2 = s2.length();
            memo = vector<vector<int>>(l1+1, vector<int>(l2+1, INT_MAX));
            return solve(s1, l1, s2, l2);
        }
        
    private:
        vector<vector<int>> memo;
        int solve(const string& s1, int i, const string& s2, int j) {
            if (i == 0 && j == 0) return 0;
            if (memo[i][j] != INT_MAX) return memo[i][j];
            if (i == 0) return memo[i][j] = solve(s1, i, s2, j-1) + s2[j-1];
            if (j == 0) return memo[i][j] = solve(s1, i-1, s2, j) + s1[i-1];
            if (s1[i-1] == s2[j-1]) return memo[i][j] = solve(s1, i-1, s2, j-1);
            return memo[i][j] = min(solve(s1, i-1, s2, j) + s1[i-1],
                                    solve(s1, i, s2, j-1) + s2[j-1]);
        }
    };
    

      

    Approach #2: DP. [Java]

    class Solution {
        public int minimumDeleteSum(String s1, String s2) {
            int l1 = s1.length();
            int l2 = s2.length();
            int[][] dp = new int[l1+1][l2+1];
            for (int i = 1; i <= l1; ++i)
                dp[i][0] = dp[i-1][0] + s1.charAt(i-1);
            for (int j = 1; j <= l2; ++j)
                dp[0][j] = dp[0][j-1] + s2.charAt(j-1);
            for (int i = 1; i <= l1; ++i)
                for (int j = 1; j <= l2; ++j)
                    if (s1.charAt(i-1) == s2.charAt(j-1))
                        dp[i][j] = dp[i-1][j-1];
                    else
                        dp[i][j] = Math.min(dp[i-1][j] + s1.charAt(i-1),
                                       dp[i][j-1] + s2.charAt(j-1));
            return dp[l1][l2];
        }
    }
    

      

    Reference:

    http://zxi.mytechroad.com/blog/dynamic-programming/leetcode-712-minimum-ascii-delete-sum-for-two-strings/

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    centos7内存处理
    MySQl分析工具之mysqltuner.pl及mysqlslap
    Mycat-web 安装
    【NOI2001】【Luogu P2704】【POJ1185】炮兵阵地
    【OpenJudge 7834】分成互质组
    Assignment(单调队列)
    OO’s Sequence
    【注意】邻接表
    20190405模拟测试
    【USACO2010open】时间旅行
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10533398.html
Copyright © 2011-2022 走看看