Description:输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
public class Solution {
public boolean VerifySquenceOfBST(int [] sequence) {
if (sequence.length == 0) return false;
return judge(sequence, 0, sequence.length - 1);
}
public boolean judge(int[] a, int l, int r) {
if (l >= r) return true;
int val = r;
while (val > l && a[val - 1] > a[r]) --val;
for (int j = val - 1; j >= l; j--) if (a[j] > a[r])
return false;
return judge(a, l, val - 1) && judge(a,val, r-1);
}
}