标签:style blog io ar color sp for on div
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 l1 = word2.length(); int l2 = word1.length(); vector<vector<int> > dp; for(int i=0; i<=l1; i++){ vector<int> tmp(l2+1, 0); dp.push_back(tmp); } for(int i=0;i<=l1;i++){ dp[i][0] = i; } for(int i=0;i<=l2;i++){ dp[0][i] = i; } int a, b; for(int i=1;i<=l1;i++){ for(int j=1;j<=l2;j++){ a = (word2[i-1] == word1[j-1]) ? dp[i-1][j-1] : (dp[i-1][j-1]+1); b = min(dp[i-1][j],dp[i][j-1]) + 1; dp[i][j] = min(a, b); } } return dp[l1][l2]; } };
标签:style blog io ar color sp for on div
原文地址:http://www.cnblogs.com/code-swan/p/4141219.html