题目:
输入一个整数数组,判断该数组是不是某二叉搜索树(left<root<right)的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
答案:
递归,代码如下:
import java.util.*;
public class Solution {
public boolean VerifySquenceOfBST(int [] sequence) {
if(sequence==null||sequence.length==0){
return false;
}
int root = sequence[sequence.length-1];
int index = -1;
//找到左右子树分割点
for(int i=0;i<sequence.length-1;i++){
if(sequence[i]>root){
index = i;
break;
}
}
boolean left = true;
boolean right = true;
//有右子树
if(index>-1){
for(int i=index;i<sequence.length-1;i++){
//如果右子树有比root小的数字,false
if(sequence[i]<root){
return false;
}
}
right = VerifySquenceOfBST(Arrays.copyOfRange(sequence,index,sequence.length-1));
}
if(index>0){
//有左子树
left = VerifySquenceOfBST(Arrays.copyOfRange(sequence,0,index));
}
return left&&right;
}
}