代码如下所示:
class Solution {
public:
bool VerifySquenceOfBST(vector<int> sequence) {
if(sequence.size()>0){
vector<int> left, right;
int len=sequence.size();
int root=sequence[len-1];
int flag=0;
int i=0;
for(;i<len-1;i++){
if(sequence[i]<root)
left.push_back(sequence[i]);
else break;
}
for(;i<len-1;i++){
if(sequence[i]>root)
right.push_back(sequence[i]);
else return 0;
}
return 1;//母序列检查成功
if(VerifySquenceOfBST(left)&&VerifySquenceOfBST(right))
return 1;
else
return 0;
}
if(sequence.size()==0)
return 0;
return 0;
}
};