LeetCode（剑指 Offer）- 33. 二叉搜索树的后序遍历序列

题目链接：点击打开链接

题目大意：略

解题思路

相关企业

• 微软（Microsoft）
• Facebook
• 字节跳动

AC 代码

• Java

class Solution {
    public boolean verifyPostorder(int[] postorder) {
        return recur(postorder, 0, postorder.length - 1);
    }
    boolean recur(int[] postorder, int i, int j) {
        if(i >= j) return true;
        int p = i;
        while(postorder[p] < postorder[j]) p++;
        int m = p;
        while(postorder[p] > postorder[j]) p++;
        return p == j && recur(postorder, i, m - 1) && recur(postorder, m, j - 1);
    }
}

• C++

class Solution {
public:
    bool verifyPostorder(vector& postorder) {
        return recur(postorder, 0, postorder.size() - 1);
    }
private:
    bool recur(vector& postorder, int i, int j) {
        if(i >= j) return true;
        int p = i;
        while(postorder[p] < postorder[j]) p++;
        int m = p;
        while(postorder[p] > postorder[j]) p++;
        return p == j && recur(postorder, i, m - 1) && recur(postorder, m, j - 1);
    }
};