题解 | #二叉搜索树的后序遍历序列#

#include <cmath>
#include <vector>
class Solution {
public:
    bool VerifySquenceOfBST(vector<int> sequence) {
        if(sequence.size()==1){
            return true;
        }
        if(sequence.size()==0){
            return false;
        }
        int m=sequence[sequence.size()-1];
        vector<int> vecl,vecr;
        int i=0;
        while(sequence[i]<m){
            vecl.push_back(sequence[i]);
            i++;
        }
        for(i;i<sequence.size()-1;i++){
            if(sequence[i]>m){
                vecr.push_back(sequence[i]);
            }
            else{
                return false;
            }
        }
        if(vecl.size()==0){
            return VerifySquenceOfBST(vecr);
        }
        if(vecr.size()==0){
            return VerifySquenceOfBST(vecl);
        }
        return VerifySquenceOfBST(vecl)&&VerifySquenceOfBST(vecr);
    }
};