刷牛客二叉树相关题时遇到了一点问题
问题遇到的现象和发生背景
public class Solution {
public boolean VerifySquenceOfBST(int [] sequence) {
if(sequence.length==0){return false;}
return aaa(sequence,0,sequence.length-1);
}
public boolean aaa(int [] n,int st,int end){
if(st>end){
return false;
}
int len=end-st+1;
int rootval=n[end];
int i=0;
for(;i<len-1;i++){
if(n[i]>rootval){
break;
}
}
for(int j=i;j<len-1;j++){
if(n[j]<=rootval){
return false;
}
}
boolean left=true;
if(i>0)
left=aaa(n,st,i-1);
boolean right=true;
if(i<len-1)
right=aaa(n,i,end-1);
return left&&right;
}
}