[leetcode]583. Delete Operation for Two Strings

题目链接：https://leetcode.com/problems/delete-operation-for-two-strings/#/description

 

Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.

Example 1:

Input: "sea", "eat"
Output: 2
Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".

 

To make them identical, just find the longest common subsequence. The rest of the characters have to be deleted from the both the strings, which does not belong to longest common subsequence.

 

class Solution{  
public:  
    int minDistance(string word1,string word2)  
    {  
        if(word1.size()==0 || word2.size()==0)  
            return word1.size()+word2.size();  
        vector<vector<int>> dp(word1.size()+1,vector<int>(word2.size()+1,0));  
        for(int i=0;i<=word1.size();i++)  
        {  
            for(int j=0;j<=word2.size();j++)  
            {  
                if(i==0 || j==0)  
                    dp[i][j]=0;  
                else  
                    dp[i][j]=(word1[i-1]==word2[j-1])?dp[i-1][j-1]+1:max(dp[i-1][j],dp[i][j-1]);  
            }  
        }  
        int val=dp[word1.length()][word2.length()];  
        return word1.length()-val+word2.length()-val;  
    }  
};