大家可以帮我看看哪里错了吗,剑指offer二叉搜索树的后序遍
不通过
您的代码已保存
请检查是否存在数组越界等非法访问情况
case通过率为0.00%
请检查是否存在数组越界等非法访问情况
case通过率为0.00%
public class Solution {
public boolean VerifySquenceOfBST(int [] sequence) {
if(sequence.length == 0){
return false;
}
if(sequence.length == 1){
return true;
}
return partation(sequence,0,sequence.length-1);
}
public boolean partation(int[] arr, int left, int right){
if(left == right){return true;}
int i = left;
while(arr[i]<arr[right]){i++;}
int temp = i;
while(i<right){
if(arr[i]<arr[right]){return false;}
i++;
}
return partation(arr,left,temp-1) && partation(arr,temp,right-1);
}
}