Edit Distance

标签：dp   string   

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

#include<iostream>
#include<vector>
#include<string>
using namespace std;

int minDistance(string word1, string word2) {
	int m = word1.size()+1;
	int n = word2.size()+1;

	vector<vector<int>>Distance(m,vector<int>(n,0));

	for (int i = 0;i!=m;++i)
		Distance[i][0] = i;
	for (int j = 0;j!=n;++j)
		Distance[0][j] = j;

	for (int i = 1;i!=m;++i)
	{
		for (int j =1;j!=n;++j)
		{
			if (word1[i-1]==word2[j-1])
				Distance[i][j] = Distance[i-1][j-1];
			else
				Distance[i][j] = Distance[i-1][j-1]+1;
			Distance[i][j] = min(Distance[i][j],min(Distance[i-1][j]+1,Distance[i][j-1]+1));
		}
	}
	return Distance[m-1][n-1];
}

Edit Distance

标签：dp   string   

原文地址：http://blog.csdn.net/li_chihang/article/details/44803099