输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
class Solution {
public:
bool VerifySquenceOfBST(vector<int> sequence) {
if(sequence.empty())
return false;
return _VerifySquenceOfBST(sequence.begin(),sequence.size());
}
bool _VerifySquenceOfBST(vector<int>::iterator sequence,int size)
{
if(size <= 1)
return true;
int pos = 0;
for(int i = 0;i<size;++i)
{
if(sequence[i]>=sequence[size-1])//>= [6,7]
{
pos = i;
break;
}
}
for(size_t i = pos;i<size-1;++i)
{
if(sequence[i]<sequence[size-1])
return false;
}
return _VerifySquenceOfBST(sequence,pos)&&_VerifySquenceOfBST(sequence+pos,size-pos-1);
}
};