[leetcode]712. Minimum ASCII Delete Sum for Two Strings

[leetcode]712. Minimum ASCII Delete Sum for Two Strings

---

Analysis

new plan~—— [好好养生啊！！]

Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.
显然DP解决~

Implement

class Solution {
public:
    int minimumDeleteSum(string s1, string s2) {
        int len1 = s1.size();
        int len2 = s2.size();
        vector<vector<int> > dp(len1+1, vector<int>(len2+1, 0));
        for(int i=1; i<=len2; i++)
            dp[0][i] = dp[0][i-1]+s2[i-1];
        for(int i=1; i<=len1; i++)
            dp[i][0] = dp[i-1][0]+s1[i-1];
        for(int i=1; i<=len1; i++){
            for(int j=1; j<=len2; j++){
                if(s1[i-1] != s2[j-1])
                    dp[i][j] = min(dp[i-1][j]+s1[i-1], dp[i][j-1]+s2[j-1]);
                else
                    dp[i][j] = dp[i-1][j-1];
            }
        }
        return dp[len1][len2];
    }
};