Edit Distance
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) {
vector<vector<int> > matrix(word1.size()+1, vector<int>(word2.size()+1));
for(int i = 0; i <= word1.size(); ++i)
matrix[i][0] = i;
for(int i = 0; i <= word2.size(); ++i)
matrix[0][i] = i;
for(int i = 1; i <= word1.size(); ++i)
{
for(int j = 1; j <= word2.size(); ++j)
{
matrix[i][j] = matrix[i-1][j-1];
if(word1.at(i-1) != word2.at(j-1))
++matrix[i][j];
matrix[i][j] = min(matrix[i][j], min(matrix[i-1][j]+1, matrix[i][j-1]+1));
}
}
return matrix[word1.size()][word2.size()];
}
};