leetcode算法题--二叉搜索树的后序遍历序列

原题链接：https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/

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

bool recur(vector<int> postorder, int i, int j) {
    if(i >= j) return true;
    int p = i;
    while (postorder[p] < postorder[j]) p++;//划分左右区间，p指向分界点
    int m = p;//保存p到m
    while (postorder[p] > postorder[j]) p++;//分界点右边应该都大于根节点
    return p == j && recur(postorder, i, m - 1) && recur(postorder, m, j - 1);
}