Lintcode 1076. Minimum ASCII Delete Sum for Two Strings (Python) (Medium)

Minimum ASCII Delete Sum for Two Strings

Description:

Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.

Example
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.
Notice
0 < s1.length, s2.length <= 1000.
All elements of each string will have an ASCII value in [97, 122].

Code:

class Solution:
    """
    @param s1: a string
    @param s2: a string
    @return: the lowest ASCII sum of deleted characters to make two strings equal
    """
    def minimumDeleteSum(self, s1, s2):
        # Write your code here
        l1, l2 = len(s1), len(s2)
        o1, o2 = sum(ord(i) for i in s1), sum(ord(i) for i in s2)
        dp = [[0]*(l1+1) for _ in range(l2+1)]
        for i in range(1, l2+1):
            for j in range(1, l1+1):
                
                if s2[i-1]==s1[j-1]:
                    dp[i][j] = dp[i-1][j-1] + ord(s2[i-1])
                else:
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1])
        
        return o1+o2-2*dp[l2][l1]