Leetcode712. Minimum ASCII Delete Sum for Two Strings

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

题目分析：

这道题，用动态规划来解决。而动态规划难就难在如何规划并且找到子问题。

在这道题中，我们用一个二维数组来标记

dp[i][j]（表示s1字符串前i个字符中和s2字符串前j个字符中需要删除多少个阿斯科玛才能相等）

子问题分析：

if (s1[i-1] != s2[j-1]) {
	/* why can't dp[i][j] = dp[i- 1][j-1] + s1[i-1] + s2[j-1];*/
       	dp[i][j] = min(dp[i-1][j]+s1[i-1], dp[i][j-1]+s2[j-1]); //it's important to understand this
}
else
  	dp[i][j] = dp[i-1][j-1];

代码：

class Solution {
public:
    int minimumDeleteSum(string s1, string s2) {
        vector<int> n(s2.size() + 1);
        vector<vector<int>> dp(s1.size() + 1, n);
        for (int i = 1; i <= s1.size(); i++) {
            dp[i][0] += dp[i-1][0] + s1[i-1];
        }
        for (int i = 1; i <= s2.size(); i++) {
            dp[0][i] += dp[0][i-1] + s2[i-1];
        }
        for (int i = 1; i <= s1.size(); i++) {
            for (int j = 1; j <= s2.size(); j++) {
                if (s1[i-1] != s2[j-1]) {
                    /* why can't dp[i][j] = dp[i- 1][j-1] + s1[i-1] + s2[j-1];*/
                    dp[i][j] = min(dp[i-1][j]+s1[i-1], dp[i][j-1]+s2[j-1]); //it's important to understand this
                }
                else
                    dp[i][j] = dp[i-1][j-1];
            }
        }
        return dp[s1.size()][s2.size()];
    }
};