UVA 536 - Tree Recovery（二叉树重建）

Tree Recovery

题目链接：Tree Recovery

ps:小白书上的例题

代码：

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

void build(int n,char *s1,char *s2,char *s)
{
    if(n<=0)
        return ;
    int p=strchr(s2,s1[0])-s2;
    build(p,s1+1,s2,s);
    build(n-p-1,s1+p+1,s2+p+1,s+p);
    s[n-1]=s1[0];
}

int main()
{
    char s1[30],s2[30],ans[30];
    while(~scanf("%s%s",s1,s2))
    {
        int n=strlen(s1);
        build(n,s1,s2,ans);
        ans[n]='\0';
        printf("%s\n",ans);
    }
    return 0;
}