LeetCode：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]

解题思路：

生成一个二维数组，其中dp[i][j]表示s1的前i个字符子串和s2的前j个字符子串要使得两个字符子串相等所需要删除的字符的ASCII码和。那我们首先把dp[i][0]设置成当s2为空时，s1所需要删除的ASCII，也就是s1的前i个字符子串的ASCII和，dp[0][j]同理。

那么，当s1[i]==s2[j]时，直接将dp[i][j]赋值为dp[i-1][j-1]就行，表示此时添加的两个字符（s1[i]、s2[j]）对原来两个字符子串的比较没有影响；否则，有两种选择，其一，删除s1[i]，即原字符子串（s1[,i-1]和s2[,j]）添加了一个字符s1[i]时，要保持两个字符子串相同，就用原字符子串的dp值+s1[i]，也就是dp[i-1][j]+ord(s1[i-1]);同理，另一个种就是dp[i][j-1]+ord(s2[j-1]).取两个值得较小值，就是使当前两个字符子串相同的删除的最小ASCII值。

则，最后的结果就是dp矩阵右下角的值。

代码：

class Solution:
    def minimumDeleteSum(self, s1, s2):
        """
        :type s1: str
        :type s2: str
        :rtype: int
        """
        len1=len(s1)+1
        len2=len(s2)+1
        dp=[[0]*len2 for i in range(len1)]
        for i in range(1,len2,1):dp[0][i]=dp[0][i-1]+ord(s2[i-1])
        for i in range(1,len1,1):
            dp[i][0]=dp[i-1][0]+ord(s1[i-1])
            for j in range(1,len2,1):
                if(s1[i-1]==s2[j-1]):
                    dp[i][j]=dp[i-1][j-1]
                else:
                    dp[i][j]=min(dp[i-1][j]+ord(s1[i-1]),dp[i][j-1]+ord(s2[j-1]))
        return dp[i][j]