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

class Solution {
    public boolean verifySequenceOfBST(int [] sequence) {
        Stack stack = new Stack<>();
        int root = Integer.MAX_VALUE;
        for(int i = sequence.length - 1; i >=0; i--){
            if(sequence[i] > root) return false;
            while(!stack.isEmpty() && stack.peek() > sequence[i])
                root = stack.pop();
            stack.add(sequence[i]);
        }
        return true;
    }
}