首页 > 代码库 > Edit Distance
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 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]; }};
Edit Distance
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。