问题描述:
Given two strings s1, s2
, find the lowest ASCII sum of deleted characters to make two strings equal.
示例:
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.
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。
通过分析发现当s1[i] = s2[j]时,dp[i + 1][j + 1] = dp[i][j];若不相等时,dp[i + 1][j + 1] = min(dp[i][j + 1] + s1[i]的ascall码值,dp[i +1][j] + s2[j]的ascall码值,dp[i][j] + s1[i]的ascall码值 + s2[j]的ascall码值 );
过程详见代码:
class Solution { public: int minimumDeleteSum(string s1, string s2) { vector<vector<int>> dp(s1.length() + 1, vector<int>(s2.length() + 1, 0)); for (int i = 1; i <= s1.length(); i++) dp[i][0] = dp[i - 1][0] + s1[i - 1] - 'a' + 97; for (int j = 1; j <= s2.length(); j++) dp[0][j] = dp[0][j - 1] + s2[j - 1] - 'a' + 97; for (int i = 1; i <= s1.length(); i++) { for (int j = 1; j <= s2.length(); j++) { if (s1[i - 1] == s2[j - 1]) { dp[i][j] = dp[i - 1][j - 1]; } else { dp[i][j] = min(dp[i - 1][j - 1] + s2[j - 1] - 'a' + 97 + s1[i - 1] - 'a' + 97, min(dp[i][j - 1] + s2[j - 1] - 'a' + 97, dp[i - 1][j] + s1[i - 1] - 'a' + 97)); } } } return dp[s1.length()][s2.length()]; } };