712. Minimum ASCII Delete Sum for Two Strings

---

题目描述

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].

题意分析

给定字符串s1, s2。删除其中的一些字符使得两字符串相等
删除字符的代价是被删字符ASCII之和，求最小代价。

算法分析

动态规划, 类似编辑距离, 参考编辑距离得:

//E(i, j) 表示第s1的长度为i的子串到s2的长度为j的子串的'编辑距离'
for i = 1,2,...,m
    E(i, 0) = E(i-1, 0) + s1[i-1]  // 每一步的代价不再是1,所以要改成对应字符串的ASCII之和
for j = 1,2,...,n
    E(0, j) = E(0, j-1) + s2[j-1]  // 同上
for i = 1,2,...,m
    for j = 1,2,...,n
        if s1[i-1] == s2[j-1]
            E(i, j) = E(i-1, j-1)
        else
            E(i, j) = min{E(i-1, j)+s1[i-1], E(i, j-1)+s2[j-1]}

时间复杂度$O(MN)$
空间复杂度$O(MN)$

具体实现

实现的时候可以将一部分的初始化整合到主循环中, 减少一次不必的循环.

class Solution {
public:
    int minimumDeleteSum(string s1, string s2) {
        int m = s1.size(), n = s2.size();
        vector<vector<int>> E(m + 1, vector<int>(n + 1, 0));

        for (int j = 1; j <= n; j++) 
                E[0][j] = E[0][j-1] + s2[j-1];

        for (int i = 1; i <= m; i++) {
            E[i][0] = E[i-1][0] + s1[i-1];
            for (int j = 1; j <= n; j++) {
                if (s1[i-1] == s2[j-1])
                    E[i][j] = E[i-1][j-1];
                else
                    E[i][j] = min(E[i-1][j]+s1[i-1], E[i][j-1]+s2[j-1]);
            }
        }
        return E[m][n];
    }
};