leetcode Ch2-Dynamic Programming I

一、

1. Edit Distance

 1 class Solution
 2 {
 3 public:
 4     int minDistance(string t1,string t2)
 5     {
 6         int len1=t1.size(),len2=t2.size();
 7         vector<vector<int>> dp(len1+1,vector<int>(len2+1,0));
 8         for(int i=0;i<=len1;i++) dp[i][0]=i;
 9         for(int i=0;i<=len2;i++) dp[0][i]=i;
10         for(int i=1;i<=len1;i++)
11         {
12             for(int j=1;j<=len2;j++)
13             {
14                 dp[i][j]=min(min(dp[i-1][j]+1,dp[i][j-1]+1),dp[i-1][j-1]+(t1[i-1]==t2[j-1]?0:1));
15             }
16         }
17         return dp[len1][len2];
18     }
19 };

View Code