leetcode 72. Edit Distance (medium)

最新推荐文章于 2020-12-09 17:31:30 发布

ccczxacxzxcz

最新推荐文章于 2020-12-09 17:31:30 发布

阅读量122

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/ruohua3kou/article/details/95233243

版权

leetcode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

看了这篇题解才解出来。

class Solution
{
public:
	int minDistance(string word1, string word2)
	{
		int len1 = word1.size();
		int len2 = word2.size();
		vector<vector<int>> dp(len1+1, vector<int>(len2+1, 0));
		for (int i = 1; i <= len1; i++)
			dp[i][0] = dp[i - 1][0] + 1;
		for (int j = 1; j <= len2; j++)
			dp[0][j] = dp[0][j - 1] + 1;
		for (int i = 1; i <= len1; i++)
			for (int j = 1; j <= len2; j++)
			{
				if (word1[i - 1] == word2[j - 1])
					dp[i][j] = dp[i - 1][j - 1];
				else
					dp[i][j] = min(min(dp[i][j - 1], dp[i - 1][j]), dp[i - 1][j - 1]) + 1;
			}
		return dp[len1][len2];
	}
};