712. Minimum ASCII Delete Sum for Two Strings

最新推荐文章于 2025-12-05 18:30:00 发布

转载最新推荐文章于 2025-12-05 18:30:00 发布 · 57 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Zzz-y/p/7892354.html

文章标签：

#数据结构与算法

本文介绍了一种利用动态规划解决两字符串通过删除部分字符使其相等的问题，并给出具体实现代码。目标是最小化被删除字符的ASCII码总和。

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.

给定两个字符串s1,s2，删除其中一些元素使字符串相等，要求删除的字符ASCII码总和最小。

解决思路：动态规划。s1[i]==s2[j]的时候，可以两个字符都保留，增加的ASCII=0。dp[i][j]=dp[i-1][j-1];

　　　　　　　　　　s1[i]!=s2[j]的时候，至少删除其中一个。dp[i][j] = min(dp[i-1][j]+s1[i], dp[i][j-1]+s2[j]);

 1 class Solution {
 2 public:
 3     int minimumDeleteSum(string s1, string s2) {
 4         vector<vector<int>> dp(s1.length()+1, vector<int>(s2.length()+1));
 5         for (int i=0; i<s1.length(); ++i)
 6             dp[i+1][0] = dp[i][0] + s1[i];
 7         for (int j=0; j<s2.length(); ++j)
 8             dp[0][j+1] = dp[0][j] + s2[j];
 9         for (int i=0; i<s1.length(); ++i) {
10             for (int j=0; j<s2.length(); ++j) {
11                 if (s1[i]==s2[j])
12                     dp[i+1][j+1] = dp[i][j];
13                 else
14                     dp[i+1][j+1] = min(dp[i][j+1]+s1[i], dp[i+1][j]+s2[j]);
15             }
16         }
17         return dp[s1.length()][s2.length()];
18     }
19 };