Problem
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].
Solution: DP
Time complexity: O(l1 * l2)
Space complexity: O(l1 * l2)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
// Author: Huahua // Running time: 8 ms class Solution { public: int minimumDeleteSum(string s1, string s2) { const int l1 = s1.length(); const int l2 = s2.length(); // dp[i][j] := min delete sum of (s1.substr(0, i), s2.substr(0, j)) vector<vector<int>> dp(l1 + 1, vector<int>(l2 + 1)); for (int i = 1; i <= l1; ++i) dp[i][0] = dp[i - 1][0] + s1[i - 1]; for (int j = 1; j <= l2; ++j) dp[0][j] = dp[0][j - 1] + s2[j - 1]; for (int i = 1; i <= l1; ++i) for (int j = 1; j <= l2; ++j) if (s1[i - 1] == s2[j - 1]) // keep s1[i - 1] and s2[j - 1] dp[i][j] = dp[i - 1][j - 1]; else dp[i][j] = min(dp[i - 1][j] + s1[i - 1], // delete s1[i - 1] dp[i][j - 1] + s2[j - 1]); // delete s2[j - 1] return dp[l1][l2]; } }; |
Solution2: Recursion + Memorization
Time complexity: O(l1 * l2)
Space complexity: O(l1 * l2)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
// Author: Huahua // Running time: 20 ms class Solution { public: int minimumDeleteSum(string s1, string s2) { const int l1 = s1.length(); const int l2 = s2.length(); m_ = vector<vector<int>>(l1 + 1, vector<int>(l2 + 1, INT_MAX)); return dp(s1, l1, s2, l2); } private: int dp(const string& s1, int i, const string& s2, int j) { if (i == 0 && j == 0) return 0; if (m_[i][j] != INT_MAX) return m_[i][j]; if (i == 0) // s1 is empty. return m_[i][j] = dp(s1, i, s2, j - 1) + s2[j - 1]; if (j == 0) // s2 is empty return m_[i][j] = dp(s1, i - 1, s2, j) + s1[i - 1]; if (s1[i - 1] == s2[j - 1]) // skip s1[i-1] / s2[j-1] return m_[i][j] = dp(s1, i - 1, s2, j - 1); return m_[i][j] = min(dp(s1, i - 1, s2, j) + s1[i - 1], // del s1[i-1] dp(s1, i, s2, j - 1) + s2[j - 1]); // del s2[j-1] } vector<vector<int>> m_; }; |
Related Problems
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Paypal
Venmo
huahualeetcode
huahualeetcode
微信打赏
Be First to Comment