输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
class Solution {
public:
bool check(vector<int>& s,int l,int r){
if(r - l <= 2) return true;
int index = l;
while(s[index] < s[r]) index ++;
for(int i = index ; i < r ; i ++)
if(s[i] < s[r]) return false;
return check(s,l,index-1) && check(s,index,r-1);
}
bool VerifySquenceOfBST(vector<int> sequence) {
if(sequence.size() == 0) return false; //鲁棒性: 判断序列是否为空
return check(sequence,0,sequence.size()-1);
}
};
class Solution {
public:
bool VerifySquenceOfBST(vector<int> sequence) {
int size = sequence.size();
if(0==size)return false;
int i = 0;
while(--size)
{
while(sequence[i++]<sequence[size]);
while(sequence[i++]>sequence[size]);
if(i<size)return false;
i=0;
}
return true;
}
};