class Solution {
public:
int minDistance(string word1, string word2) {
//dp[i][j] 表示 ord1[0..i-1] -> word2[0..j-1] 最少的次数
int row=word1.size();
int col=word2.size();
vector<vector<int> > dp(row+1,vector<int>(col+1));
dp[0][0]=0;
for(int i=1;i<=col;i++){ // 由空到插入
dp[0][i]=i;
}
for(int i=1;i<=row;i++){ //word1 -> "" 删除
dp[i][0]=i;
}
for(int i=1;i<=row;i++){
for(int j=1;j<=col;j++){
if(word1[i-1]==word2[j-1]){
int temp=min(dp[i-1][j]+1,dp[i][j-1]+1);
dp[i][j]=min(dp[i-1][j-1],temp);
}else{
int temp=min(dp[i-1][j]+1,dp[i][j-1]+1);
dp[i][j]=min(dp[i-1][j-1]+1,temp); //i-1 写成了 i
}
}
}
return dp[row][col];
}
};