【leetcode】Edit Distance

class Solution {
public:
    
    int minDistance(string word1, string word2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        int len1=word1.length();
        int len2=word2.length();
        
        vector<vector<int> > dp(len1+1, vector<int>(len2+1));
        
        for(int i=0;i<=len1;i++)//边界条件，不会返回出
            dp[i][0]=i;
        for(int i=0;i<=len2;i++)//边界条件，不会返回出
            dp[0][i]=i;
        
        for(int i=1;i<=len1;i++)//dp[][]中有效数据的下标从1开始
            for(int j=1;j<=len2;j++)
            {
                if(word1[i-1]==word2[j-1])//string word1中有效字符的下标从0开始
                    dp[i][j]=dp[i-1][j-1];
                else
                {
                    int tmp1=1+dp[i-1][j];//delete the tail char of word1
                    int tmp2=1+dp[i][j-1];//insert the tail char of word2 at the tail of word1
                    int tmp3=1+dp[i-1][j-1];//replace the tail of word1 with the tail of word2
                    dp[i][j]=min(min(tmp1,tmp2),tmp3); 
                }    
            }
        
        return dp[len1][len2];
    }
};