标签：
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitted on a word:
a) Insert a character
b) Delete a character
c) Replace a character
class Solution { public: int minDistance(string word1, string word2) { int m=word1.size(); int n=word2.size(); if(m==0)return n; if(n==0)return m; vector<int> vec(n+1,INT_MAX); vector<vector<int>> d(m+1,vec); for(int ii=0;ii<=m;ii++)d[ii][0]=ii; for(int jj=0;jj<=n;jj++)d[0][jj]=jj; for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) { if(word1[i-1]==word2[j-1])d[i][j]=d[i-1][j-1]; else { d[i][j]=min(d[i-1][j-1]+1,min(d[i-1][j]+1,d[i][j-1]+1)); } } } return d[m][n]; } };
标签：
原文地址：http://www.cnblogs.com/Vae98Scilence/p/4281473.html
