【DP】这道题是583. 两个字符串的删除操作的扩展,相当于把删除的权值1改成了这里的ascii码,但是dp的思路还是一样的。首先dp[i][j]代表走到s1[i], s2[j]的时候保持字符串相等需要删除的最小权值,那么当s1[i]和s2[j]相等的时候不需要删除,那么dp[i][j] = dp[i - 1][j - 1],否则的话从删除s1[i]和删除s2[j]中选择一种最小的方案,dp[i][j] = Math.min(dp[i - 1][j] + s1[i], dp[i][j - 1] + s2[j]).
class Solution {
public int minimumDeleteSum(String s1, String s2) {
int m = s1.length(), n = s2.length();
int[][] dp = new int[m + 1][n + 1];
for (int i = 1; i <= m; i++) dp[i][0] = dp[i - 1][0] + s1.charAt(i - 1);
for (int i = 1; i <= n; i++) dp[0][i] = dp[0][i - 1] + s2.charAt(i - 1);
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (s1.charAt(i - 1) == s2.charAt(j - 1)) dp[i][j] = dp[i - 1][j - 1];
else dp[i][j] = Math.min(dp[i - 1][j] + s1.charAt(i - 1) , dp[i][j - 1] + s2.charAt(j - 1));
}
}
return dp[m][n];
}
}