[LeetCode] 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) {        int len1 = word1.size() + 1,len2 = word2.size() + 1;        vector<vector<int> >p(len1,vector<int>(len2));        p[0][0] = 0;        for(int i = 1;i < len1;i ++)            p[i][0] = i;        for(int i = 1;i < len2;i ++)            p[0][i] = i;        for(int i = 1;i < len1;i ++){            for(int j = 1;j < len2;j ++){                if(word1[i - 1] == word2[j - 1])                    p[i][j] = p[i - 1][j - 1];                else{                    p[i][j] = p[i - 1][j - 1] + 1;                    p[i][j] = min(p[i][j],min(p[i - 1][j] + 1,p[i][j - 1] + 1));                }            }        }        return p[len1 - 1][len2 - 1];    }};

参考