题解 | #二叉搜索树的后序遍历序列#

    public boolean VerifySquenceOfBST(int [] sequence) {
        if(sequence.length == 0){
             return false;
        }
        return dfs(sequence,0,sequence.length-1);
    }
    public boolean dfs(int[] seq,int i,int j){
         if(i >= j){
          return true;
       }
        int q = i;
        while(seq[q] < seq[j]){
            q++;
        }
        int m = q;
        while(seq[m] > seq[j]){
            m++;
        }
        return m == j &&(dfs(seq,i,q-1) && dfs(seq,q,j-1));
    } 
}