LeetCode 712 两个字符串的最小ASCII删除和

• 分析
  本题的思路和LeetCode583题很像，dp数组的含义非常相似，不同的是word1[i] != word2[j]时，状态的转移有些不同。
• 代码

class Solution {
    
    
public:
    int minimumDeleteSum(string word1, string word2) {
    
    
        int len1 = word1.length();
        int len2 = word2.length();

        vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1, 0));
        for(int i = 1; i <= len1; i++) dp[i][0] = (int)word1[i - 1] + dp[i - 1][0];
        for(int i = 1; i <= len2; i++) dp[0][i] = (int)word2[i - 1] + dp[0][i - 1];

        for(int i = 1; i <= len1; i++){
    
    
            for(int j = 1; j <= len2; j++){
    
    
                if(word1[i - 1] == word2[j - 1]){
    
    
                    dp[i][j] = dp[i - 1][j - 1];
                }else{
    
    
                    dp[i][j] = min(dp[i - 1][j] + word1[i - 1], dp[i][j - 1] + word2[j - 1]);
                }
            }
        }

        return dp[len1][len2];
    }
};