1119 Pre- and Post-order Traversals (30 分)

最新推荐文章于 2022-10-21 16:50:28 发布

Yo3ngLau

最新推荐文章于 2022-10-21 16:50:28 发布

阅读量95

点赞数

分类专栏： PAT (Advanced Level) Practice 树的遍历

本文链接：https://blog.csdn.net/weixin_43359312/article/details/103235101

版权

PAT (Advanced Level) Practice 同时被 2 个专栏收录

87 篇文章 0 订阅

订阅专栏

树的遍历

9 篇文章 0 订阅

订阅专栏

1119 Pre- and Post-order Traversals (30 分)

解题思想

AC代码

#include <iostream>
#include <vector>
using namespace std;
vector<int> in, pre, post;
bool uniquee = true;
void getIn(int preLeft, int preRight, int postLeft, int postRight){
    if (preLeft == preRight){
        in.push_back(pre[preLeft]);
        return;
    }
    if (pre[preLeft] == post[postRight]){
        int i = preLeft + 1;
        while (i <= preRight && pre[i] != post[postRight-1]) i++;
        if (i - preLeft > 1)
            getIn(preLeft+1, i-1, postLeft, postLeft+(i-preLeft-1)-1);
        else uniquee = false;
        in.push_back(post[postRight]);
        getIn(i, preRight, postLeft+(i-preLeft-1), postRight-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", uniquee == true ? "Yes" : "No", in[0]);
    for (int i = 1; i < in.size(); i++)
        printf(" %d", in[i]);
    printf("\n");
    return 0;
}