题目描述
输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
class Solution {
public:
bool VerifySquenceOfBST(vector<int> sequence) {
int length = sequence.size();
if(length == 0) return false;
int root = sequence[length - 1];
int i=0;
//左子树小于根结点
for(;i<length - 1;i++){
if(sequence[i] > root)
break;
}
int j = i;
//右子树大于根节点
for(;j<length-1;j++){
if(sequence[j]< root)
return false;
}
bool left = true;
if(i > 0){
vector<int> left_sequence(sequence.begin(),sequence.begin()+i);
left = VerifySquenceOfBST(left_sequence);
}
bool right = true;
if(i < length -1)
{
vector<int> right_sequence(sequence.begin()+i,sequence.end() -1 );
right = VerifySquenceOfBST(right_sequence);
}
return (left && right);
}
};