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]
.
类LCS DP,本来还想先用个标准的LCS 的,后面发现直接在LCS的基础上改一下就好了
package l712;
class Solution {
public int minimumDeleteSum(String s1, String s2) {
int[][] dp = new int[1+s1.length()][1+s2.length()];
char[] cs1 = s1.toCharArray(), cs2 = s2.toCharArray();
for(int i=1; i<=cs1.length; i++) dp[i][0] += dp[i-1][0] + cs1[i-1];
for(int i=1; i<=cs2.length; i++) dp[0][i] += dp[0][i-1] + cs2[i-1];
for(int i=1; i<=cs1.length; i++){
for(int j=1; j<=cs2.length; j++) {
if(cs1[i-1] == cs2[j-1])
dp[i][j] = dp[i-1][j-1];
else
dp[i][j] = Math.min(Math.min(dp[i-1][j]+cs1[i-1], dp[i][j-1]+cs2[j-1]), dp[i-1][j-1]+cs1[i-1]+cs2[j-1]);
}
}
return dp[cs1.length][cs2.length];
}
}