编辑距离算法

 1 class Solution {
 2 public:
 3     int minDistance(string word1, string word2) {
 4         int length1=word1.size();int length2=word2.size();
 5         int dp[length1+1][length2+1]={0};
 6         for(int i=0;i<=length1;i++) dp[i][0]=i;
 7         for(int j=0;j<=length2;j++) dp[0][j]=j;
 8         for(int i=1;i<=length1;i++)
 9             for(int j=1;j<=length2;j++)
10             {
11                 if(word1[i-1]==word2[j-1]) 
12                     dp[i][j]=min(min(dp[i-1][j],dp[i][j-1])+1,dp[i-1][j-1]);
13                 else 
14                     dp[i][j]=min(min(dp[i-1][j],dp[i][j-1])+1,dp[i-1][j-1]+1);
15             }
16         return dp[length1][length2];
17     }
18 };