题目描述
输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
class Solution {
public:
bool VerifySquenceOfBST(vector<int> sequence) {
int size = sequence.size();
if(!size) return false;
return helper(sequence,0,size-1);
}
bool helper(vector<int>& sequence,int left,int right){
if(left >= right) return true;
int mid = right-1;
while(sequence[mid] > sequence[right] && mid > left){
--mid;
}
for(int tmp = left;tmp < mid;tmp++){
if(sequence[tmp] > sequence[right]) return false;
}
return helper(sequence,left,mid) && helper(sequence,mid+1,right-1);
}
};