Leetcode 712 Minimum ASCII Delete Sum for Two Strings (算法分析week13)

最新推荐文章于 2021-11-12 11:05:31 发布

五月茶微凉

最新推荐文章于 2021-11-12 11:05:31 发布

阅读量196

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/qq_35278061/article/details/78692011

版权

Leetcode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

Minimum ASCII Delete Sum for Two Strings

题目来源：https://leetcode.com/problemset/algorithms/

题目描述
算法分析
代码实现

题目描述

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].

算法分析

题目目的是删除两个字符串s1、s2中的一些字符使两个字符串相同，并且删除的字符的ASCII和最小。
定义数组dp[][]，dp[i][j]表示实现s1前i个字符与s2前j个字符相同需要删除的字符的最小ASCII码和。dp[i][j]可以通过dp[i-1][j-1]、dp[i-1][j]、dp[i][j-1]得到。

dp[0][0] = 0;
dp[i][0] = dp[i-1][0]+s1[i-1], i>=0;
dp[0][j] = dp[0][j-1] + s2[j-1], j>=0;
dp[i][j] = min{dp[i-1][j-1]+a,dp[i-1][j]+s1[i-1], dp[i][j-1]+s2[j-1]}, i>=1&&j>=1;

如果s1[i-1] == s2[j-1],a=0; 否则a=s1[i-1]+s2[j-1];

代码实现

@requires_authorization
class Solution {
public:
    int minimumDeleteSum(string s1, string s2) {
    int m = s1.length();
    int n = s2.length();
    int **dp;
    dp = new int*[m + 2];
    for (int i = 0; i < m + 2; i++) {
        dp[i] = new int[n + 2];
    }
    dp[0][0] = 0;
    for (int i = 1; i < m + 2; i++) {
        dp[i][0] = dp[i - 1][0] + s1[i - 1];
    }
    for (int j = 1; j < n + 2; j++) {
        dp[0][j] = dp[0][j - 1] + s2[j - 1];
    }
    for (int i = 1; i <= m + 1; i++) {
        for (int j = 1; j <= n + 1; j++) {
            if (s1[i - 1] == s2[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1];
            }
            else {
                int s = s1[i - 1];
                int t = s2[j - 1];
                dp[i][j] = min(dp[i - 1][j - 1] + s + t, min(dp[i - 1][j] + s, dp[i][j - 1] + t));
            }
        }
    }
    return dp[m][n];
}
};