二叉搜索树的后序遍历序列

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

public class Solution {
    public boolean VerifySquenceOfBST(int [] sequence) {
        if(sequence == null || sequence.length == 0) return false;
        if(sequence.length == 1) return true;

        if(getPosition(sequence) == -1) return false;
        else{
            int pos = getPosition(sequence);
            int[] leftSeq = new int[pos];
            int[] rightSeq = new int[sequence.length-pos-1];
            if(pos >= 0)
                System.arraycopy(sequence, 0, leftSeq, 0, pos);
            if(sequence.length >= 1)
                System.arraycopy(sequence, pos, rightSeq, 0, sequence.length-pos-1);
            return VerifySquenceOfBST(leftSeq) ||
                    VerifySquenceOfBST(rightSeq);
        }
    }
    private int getPosition(int [] sequence){

        int cur = sequence[sequence.length - 1];
        int minPos = 0,maxPos = sequence.length - 1;
        while(minPos < maxPos){
            while(minPos >= 0 && sequence[minPos] < cur) minPos++;
            while(maxPos >= 0 && sequence[maxPos] >= cur) maxPos--;
            if(minPos < maxPos) return -1;
        }
        return minPos;
    }
}