分析:此题其实由最长公共序列变化而来,所以只需要知道最长的公共子序列即可求得至少需要多少步,使得两个字符串相等。
参考:https://blog.csdn.net/u012102306/article/details/53184446#
class Solution {
public:
int minDistance(string word1, string word2) {
//本题其实由最长公共子序列变化而来
if(word1.empty())
return word2.size();
if(word2.empty())
return word1.size();
int n = word1.size();//列
int m = word2.size();//行
vector<vector<int>> dp(m+1, vector<int>(n+1, 0));
for (int i = 1; i<=m; ++i)
{
for (int j = 1; j<=n; ++j)
{
if (word2[i-1] == word1[j-1])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
{
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
}
}
return word1.size() + word2.size() - 2*dp[m][n];
}
};
分析:此题和之前编辑距离算法差不多。直接上图,需要动一动手,才能找到其中算法规律。
class Solution {
public:
int minimumDeleteSum(string s1, string s2) {
if(s1.empty())
return s2.size();
if(s2.empty())
return s1.size();
int row = s2.size();
int col = s1.size();
vector<vector<int>> dp(row+1,vector<int>(col+1,0));
//初始化第一行
for(int i = 1;i<=col;++i)
{
dp[0][i] = dp[0][i-1]+s1[i-1];
}
//初始化第一列
for(int i = 1;i<=row;++i)
{
dp[i][0] = dp[i-1][0]+s2[i-1];
}
for(int i = 1;i<=row;++i)
{
for(int j = 1;j<=col;++j)
{
if(s2[i-1] == s1[j-1])
dp[i][j] = dp[i-1][j-1];
else
dp[i][j] = min(dp[i-1][j]+s2[i-1],dp[i][j-1]+s1[j-1]);
}
}
return dp[row][col];
}
};
如:eat和sat的dp效果图: