LeetCode —— Edit Distance

链接：http://leetcode.com/onlinejudge#question_72

原题：

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

思路：一道经典的dp题目

用cost[i][j]记录word1的长度为i，word2的长度为j时候的最小步数，

那么到i，j长度只有三种途径：

1）length(word1) = i-1, length(word2) = j, 即word1删除一个字母

2）length(word1) = i, length(word2) = j-1, 即word2插入一个字母

3）length(word1) = i-1, length(word2) = j-1, 即替换操作或者直接copy

状态转移方程：

1) if word1[i] == word2[j] , then cost[i][j] = cost[i-1][j-1]

2) if word1[i] != word2[j], then cost[i][j] = min{cost[i-1][j] + cost[i][j-1] + cost[i-1][j-1]} + 1

class Solution {
public:
    int minDistance(string word1, string word2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int m = word1.size();
        int n = word2.size();
        
        vector<int> vec0(n+1);
        vector<int> vec1(n+1);
        for (int j=0; j<=n; j++)
            vec0[j] = j;
        vector<vector<int> > cost;
        cost.push_back(vec0);
        cost.push_back(vec1);
        int pre = 0;
        int cur = 1;
        for (int i=1; i<=m; i++) {
            pre = (i + 1) % 2;
            cur = i % 2;
            cost[cur][0] = i;
            for (int j=1; j<=n; j++) {
                if (word1[i-1] == word2[j-1])
                    cost[cur][j] = cost[pre][j-1];
                else {
                    int min = cost[cur][j-1]<cost[pre][j] ? cost[cur][j-1] : cost[pre][j];
                    if (min > cost[pre][j-1])
                        min = cost[pre][j-1];
                    cost[cur][j] = min + 1;
                }
            }
        }
        
        return cost[m%2][n];
    }
};