PTA甲级 1138 Postorder Traversal (C++)

Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal sequence of the corresponding binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer $N(\le 50,000)$, the total number of nodes in the binary tree. The second line gives the preorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the first number of the postorder traversal sequence of the corresponding binary tree.

Sample Input:

7
1 2 3 4 5 6 7
2 3 1 5 4 7 6

Sample Output:

3

Caution:

找【后序遍历的第一个节点】的过程：一直往下走，如果有左孩子就顺着左孩子往下走，如果没有左孩子但有右孩子就顺着右孩子往下走，一直走到第一个没有左孩子也没有右孩子的节点，则这个节点就是后序遍历输出的第一个节点。

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-29 16:48:19
// All rights reserved.

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int preOrder[50005], inOrder[50005];
int n; 

int main(){
    scanf("%d", &n);

    for(int i = 0; i < n; ++i) scanf("%d", &preOrder[i]);
    for(int i = 0; i < n; ++i) scanf("%d", &inOrder[i]);

    int l1 = 0, l2 = 0, r1 = n - 1, r2 = n - 1;
    int thisNum = preOrder[0];

    while(true){
        if(l1 == r1){
            printf("%d\n", thisNum);
            break;
        }

        // 一定有孩子
        int posInPre = find(preOrder + l1, preOrder + r1 + 1, thisNum) - preOrder;
        int posInMid = find(inOrder + l2, inOrder + r2 + 1, thisNum) - inOrder;

        if(posInMid == l2){
            // 没有左孩子，只有右孩子
            thisNum = preOrder[posInPre + 1];
            l1++;
            l2++;
        }
        else{
            // 有左孩子
            thisNum = preOrder[posInPre + 1];
            r1 = l1 + posInMid - l2;
            r2 = posInMid - 1;
            l1++;
        }
    }

    return 0;
}