583 两个字符串的删除操作
class Solution {
public:
int minDistance(string text1, string text2) {
vector<vector<int>>dp(text1.size()+1,vector<int>(text2.size()+1,0));
int result=0;
for(int i=1;i<=text1.size();i++)
{
for(int j=1;j<=text2.size();j++)
{
if(text1[i-1]==text2[j-1])
{
dp[i][j]=dp[i-1][j-1]+1;
}
else
{
dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
}
result=dp[i][j]>result?dp[i][j]:result;
}
}
return text1.size()+text2.size()-2*result;
}
};
72编辑距离
class Solution {
public:
int minDistance(string word1, string word2)
{
vector<vector<int>>dp(word1.size()+1,vector<int>(word2.size()+1,0));
for(int i=0;i<=word1.size();i++) dp[i][0]=i;
for(int j=0;j<=word2.size();j++) dp[0][j]=j;
for(int i=1;i<=word1.size();i++)
{
for(int j=1;j<=word2.size();j++)
{
if(word1[i-1]==word2[j-1])
{
dp[i][j]=dp[i-1][j-1];
}
else
{
dp[i][j]=min({dp[i][j-1],dp[i-1][j],dp[i-1][j-1]})+1;
}
}
}
return dp[word1.size()][word2.size()];
}
};