剑指 Offer 33. 二叉搜索树的后序遍历序列

剑指 Offer 33. 二叉搜索树的后序遍历序列

参考> https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/solution/mian-shi-ti-33-er-cha-sou-suo-shu-de-hou-xu-bian-6/

我的c++代码

class Solution {
public:
    bool recur(const vector<int>& postorder,int l,int r)
    {
        if(l>=r)
            return true;
        int index=r;
        for(int i=l;i<r-1;i++)
        {
            if(postorder[i]>postorder[r])
            {
                index=i;
                break;
            }
        }
        for(int i=index+1;i<r;i++)
        {
            if(postorder[i]<=postorder[r])
            {
                return false;
            }
        }

        return recur(postorder,l,index-1)&&recur(postorder,index,r-1);

    }
    bool verifyPostorder(vector<int>& postorder) {
        return recur(postorder,0,postorder.size()-1);
    }
};