leetcode刷题

两个字符串的删除操作

本质就是求最长公共子序列，然后用两个字串的大小分别减去最长的子序列大小再相加，就是最终结果。

int minDistance(string word1, string word2) {
        vector<vector<int>> dp(word1.size() + 1, vector<int> (word2.size() + 1));
        for(int i = 1; i <= word1.size(); i++){
            for(int j = 1; j <= word2.size(); 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]);
                }
            }
        }
        int result = word1.size() + word2.size() - dp[word1.size()][word2.size()]*2;
        return result;
    }

编辑距离

本质还是找子序列，只是递推的过程不一样。

int minDistance(string word1, string word2) {
        if(word1.size() * word2.size() == 0)    //排除空串的情况
            return word2.size() + word1.size();
  
        vector<vector<int>> dp (word1.size(), vector<int> (word2.size()));
        if(word2[0]  == word1[0])
            dp[0][0] = 0;
        else    
            dp[0][0] = 1;
        for(int i = 1; i < word2.size(); i++){     //初始化第一行
            if(word2[i]  != word1[0]){
                dp[0][i] = dp[0][i - 1] + 1;
            }
            else{
                dp[0][i] = i;
            }   
        }
        for(int i = 1; i < word1.size(); i++){     //初始化第一列
            if(word1[i]  != word2[0]){
                dp[i][0] = dp[i - 1][0] + 1;
            }
            else{
                dp[i][0] = i;
            }   
        }
        for(int i = 1; i < word1.size(); i++){
            for(int j = 1; j < word2.size(); j++){
                if(word1[i] == word2[j])
                    dp[i][j] = dp[i - 1][j - 1];
                else    
                    dp[i][j] = min({dp[i - 1][j - 1] + 1, dp[i][j - 1] + 1, dp[i - 1][j] + 1});
            }
        }
        
        return dp[word1.size() - 1][word2.size() - 1];
    }