LeetCode583. 两个字符串的删除操作

class Solution {
public:
    int minDistance(string word1, string word2) {
        vector<vector<int>> dp(word1.length() + 1, vector<int>(word2.length() + 1, 0));
        int subMaxLength = 0;
        for(int i = 1; i <= word1.length(); i++){
            for(int j = 1; j <= word2.length(); j++){
                if(word1[i - 1] == word2[j - 1]){
                    dp[i][j] = dp[i - 1][j - 1] + 1;    
                }
                else{
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                }
                if(dp[i][j] > subMaxLength)
                //求出最长子序列长度
                    subMaxLength = dp[i][j];
            }
        }
        //由于每步仅能删一个字符 而两个字符串要想都达到subMaxLength
        //就需要用每个串的长度减去subMaxLength再求和得出总步数
        return word1.length() - subMaxLength + word2.length() - subMaxLength;
    }
};