二叉搜索树的后序遍历序列是否合法 java

输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。

public class Solution {
    public boolean VerifySquenceOfBST(int [] sequence) {
        return judge(sequence, 0, sequence.length - 1);
    }
    public boolean judge(int[] sequence, int start, int end) {
        if (sequence.length == 0) {
            return false;
        }
        if (start >= end) {
            return true;
        }
        int k = -1, j = end - 1;
        while (j >= start && sequence[j] > sequence[end]) {
            --j;
        }
        k = j;
        for (int i = start; i <= j; ++i) {
            if (sequence[i] > sequence[end]) {
                return false;
            }
        }
        boolean left = judge(sequence, start, k);
        boolean right = judge(sequence, k + 1, end - 1);
        return left && right;
    }
}