二叉搜索树的后序遍历序列 --剑指offer

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