Advanced Fruits(LCS+保存路径)

参考博客

#include <stdio.h>
#include <string.h>

char s1[1005];
char s2[1005];
int dp[1005][1005];
int mark[1005][1005];
int len1,len2;

void pre(int i,int j)//利用递归打印字母
{
    if (i == 0 && j == 0) return;
    if (mark[i][j] == 0)
    {
        pre(i-1,j-1);
        printf("%c",s1[i-1]);
    }
    else if (mark[i][j] == 1)
    {
        pre(i-1,j);
        printf("%c",s1[i-1]);
    }
    else
    {
        pre(i,j-1);
        printf("%c",s2[j-1]);
    }
}

int main()
{
    while (scanf("%s%s",s1,s2) != EOF)
    {

        memset(dp,0,sizeof(dp));

        len1 = strlen(s1);
        len2 = strlen(s2);

        for(int i = 0;i<=len1;i++) //注意对mark的初始化
            mark[i][0] = 1;  
        for(int i = 0;i<=len2;i++)  
            mark[0][i] = -1; 

        for (int i = 1; i <= len1; i++)
        {
            for (int j = 1; j <= len2; j++)
            {
                if (s1[i-1] == s2[j-1])
                {
                    dp[i][j] = dp[i-1][j-1] + 1;
                    mark[i][j] = 0;
                }
                else if (dp[i-1][j] >= dp[i][j-1])
                {
                    dp[i][j] = dp[i-1][j];
                    mark[i][j] = 1;
                }
                else
                {
                    dp[i][j] = dp[i][j-1];
                    mark[i][j] = -1;
                }
            }
        }
        pre(len1,len2);
        printf("\n");
    }

    return 0;
}