#712 Minimum ASCII Delete Sum for Two Strings

yoyooyooo

已于 2022-03-08 08:35:05 修改

阅读量327

点赞数

分类专栏： leetcode

于 2022-03-03 15:37:06 首次发布

本文链接：https://blog.csdn.net/YY_Tina/article/details/123255691

版权

leetcode 动态规划算法

leetcode 专栏收录该内容

188 篇文章 0 订阅

订阅专栏

Description

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

Examples

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.

Constraints:

1 <= s1.length, s2.length <= 1000
s1 and s2 consist of lowercase English letters.

思路

和 #358 类似，修改一下初始和状态转移里面的部分内容就可以了，我相信再看的时候可以通过代码看懂

注：java中计算字符ascii码的代码为 Integer.valueOf(str)

代码

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