PAT A1119 Pre and Post Traversals

根据后序和先序，判断树是否唯一并生成中序

#include<bits/stdc++.h>
using namespace std;
vector<int> in,pre,post;
bool unique1=true;
void getIn (int preL,int preR,int postL,int postR) {
    if (preL==preR) {
        in.push_back(pre[preL]);
        return;
    }
    if (pre[preL]==post[postR]) {
        int i=preL+1;
        while (i<=preR&&pre[i]!=post[postR-1]) 
        i++;
        if (i-preL>1) 
        getIn (preL+1,i-1,postL,postL+i-preL-2);
        else unique1=false;
        in.push_back(post[postR]);
        getIn (i,preR,postL+i-preL-1,postR-1);
    }
} 
int main () {
    int n;
    scanf ("%d",&n);
    pre.resize (n);
    post.resize (n);
    for (int i=0;i<n;i++) 
    scanf ("%d",&pre[i]);
    for (int i=0;i<n;i++)
    scanf ("%d",&post[i]);
    getIn (0,n-1,0,n-1);
    printf ("%s\n%d",unique1==true?"Yes":"No",in[0]);
    for (int i=1;i<in.size();i++)
    printf (" %d",in[i]);
    printf ("\n");
    return 0;
}