剑指offer-二叉搜索树的后序遍历序列

class Solution {
public:
    bool VerifySquenceOfBST(vector<int> sequence) {
        if(sequence.size() == 0)
            return false;
        return find(sequence, 0, sequence.size() - 1);
    }
    
    bool find(vector<int> sq,int left,int right){
        if(right - left < 1)
            return true;
        int root = sq[right];
        int l = left, r = right - 1;
        while(l < right - 1){
            if(sq[l] < root){
                l++;
            }
            else{
                break;
            }
        }
        while(r > left){
            if(sq[r] > root){
                r--;
            }
            else{
                break;
            }
        }
        if(r - l > 0)
            return false;
        return find(sq, left, r) && find(sq, l, right - 1);
    }
};