这是一道比较典型的动态规划题目,状态转移方程比较容易给出,题目给出的三种操作插入,删除,替换三种操作,分别对应三种转移方程。
1.如果两个字符串最后字符相同,情况比较简单
dp[i][j]=dp[i-1][j-1]
2.如果两个字符不相同
dp[i][j]=min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1
1.动态规划,O(mn)空间复杂度
int minDistance(string word1, string word2) {
vector<vector<int>>dp(word1.size()+1,vector<int>(word2.size()+1,0));
for(int k=0;k<=word2.size();++k)
dp[0][k]=k;
for(int k=0;k<=word1.size();++k)
dp[k][0]=k;
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(min(dp[i-1][j-1],dp[i-1][j]),dp[i][j-1])+1;
}
}
return dp[word1.size()][word2.size()];
}
2.优化后动态规划,空间复杂度O(n)
int minDistance(string word1, string word2) {
vector<int>dp(word2.size()+1,0);
for(int k=0;k<=word2.size();++k)
dp[k]=k;
for(int i=1;i<=word1.size();++i)
{
auto temp=dp;
dp[0]=i;
for(int j=1;j<=word2.size();++j)
{
if(word1[i-1]==word2[j-1])
dp[j]=temp[j-1];
else
dp[j]=min(min(temp[j-1],temp[j]),dp[j-1])+1;
}
}
return dp[word2.size()];
}
3.带备忘录的递归,递归是自上向下,跟动态规划相反
int minDistance(string word1, string word2) {
vector<vector<int>>vis(word1.size()+1,vector<int>(word2.size()+1,-1));
return help(word1,word2,word1.size(),word2.size(),vis);
}
int help(string s1,string s2,int x,int y,vector<vector<int>>&vis)
{
if(vis[x][y]!=-1)return vis[x][y];
if(x==0) {vis[x][y]=y;return y;}
if(y==0){vis[x][y]=x;return x;}
if(s1[x-1]==s2[y-1])
{
vis[x][y]=help(s1,s2,x-1,y-1,vis);
return vis[x][y];
}
auto ret1=help(s1,s2,x-1,y,vis);
auto ret2=help(s1,s2,x,y-1,vis);
auto ret3=help(s1,s2,x-1,y-1,vis);
auto res=min(min(ret1,ret2),ret3)+1;
vis[x][y]=res;
return res;
}