java 代码

class Solution {
    public boolean verifySequenceOfBST(int [] sequence) {
        int len = sequence.length;
        if(len == 0 || len == 1) return true;
        return bst(sequence,0,sequence.length-1);
    }

    public boolean bst(int[] array,int start,int end){
        if(start >= end) return true;
        int i = end;
        while(i > start  && array[i-1]>array[end]){
            i--;
        }
        for(int j = i-1;j>=start;j--){
            if(array[j] > array[end]) return false;
        }
        return (bst(array,start,i-1)) && (bst(array,i,end-1));

    }

}