最长公共子序列

#include <iostream>
using namespace std;
const int MAXN=1000+10;
string s1,s2;
int fun1(int n,int m){     //直接递归，时间复杂度O(2^(n+m))
    int answer;
    if(n==0||m==0) answer=0;
    else{
        if(s1[n]=s2[m]) answer=fun1(n-1,m-1)+1;
        else answer=max(fun1(n-1,m),fun1(n,m-1));
    }
    return answer;
}
int memo[MAXN][MAXN];      
int fun2(int n,int m){               //递归+记忆化  时间复杂度O(n*m)
    if(memo[n][m]!=-1) return memo[n][m];   //已经求过
    int answer;
    if(n==0||m==0) answer=0;
    else{
        if(s1[n]==s2[m]) answer=fun2(n-1,m-1)+1;
        else answer=max(fun2(n-1,m),fun2(n,m-1));
    }
    memo[n][m]=answer;        //保存计算结果,之后不用重新递归计算
    return answer;
}

int dp[MAXN][MAXN];
void fun3(int n,int m){               //动态规划 时间复杂度O(n*m)
    for(int i=0;i<=n;++i){
        for(int j=0;j<=m;++j){
            int answer;
            if(i==0||j==0) answer=0;
            else{
                if(s1[i]==s2[j])answer=dp[i-1][j-1]+1;
                else answer=max(dp[i-1][j],dp[i][j-1]);
            }
            dp[i][j]=answer;
        }
    }
    return;
}
int main() {
    cin>>s1>>s2;
    s1=' '+s1,s2=' '+s2;     //s1[0]和s2[0]为哨兵，方便设置边界
    int n=s1.length()-1,m=s2.length()-1;
    for(int i=0;i<=n;++i){     //初始化memo数组
        for(int j=0;j<=m;++j){
            memo[i][j]=-1;
        }
    }
    printf("fun2:%d\n",fun2(n,m));
    fun3(n,m);
    printf("fun3:%d\n",dp[n][m]);
    system("pause");
    return 0;
}