首页 > 代码库 > Leetcode Edit Distance
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
输入两个单词word1和word2，求出从word1转换成word2的最少步骤。每个转换操作算一步。转换操作限定于：
- 删除一个字符
- 插入一个字符
- 替换一个字符
本题用动态规划求解
设决策变量dp[i][j]，表示从word[0..i-1]转换为word2[0...j-1]的最少步骤
可以参考http://web.stanford.edu/class/cs124/lec/med.pdf
class Solution {public: int minDistance(string word1, string word2) { int len1 =word1.length(), len2 = word2.length(); if(len1 == 0) return len2; if(len2 == 0) return len1; if(word1 == word2) return 0; vector<vector<int> > dp(len1+1, vector<int>(len2+1,0)); for(int i = 0; i <= len1; ++ i) dp[i][0] = i; for(int j = 0; j <= len2; ++ j) dp[0][j] = j; for(int i =1; i <= len1; ++ i){ for(int j = 1; j <= len2; ++ j){ dp[i][j] = min(dp[i-1][j-1]+(word1[i-1] != word2[j-1]? 1: 0),min(dp[i-1][j]+1, dp[i][j-1]+1)); } } return dp[len1][len2]; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。