Leetcode刷题笔记(c++)

class Solution {
public:
    bool dfs(vector& postorder,int l,int r){
        // cout<<"大循环"<=r)return 1;
        int i=l;
        while(postorder[i]postorder[r])i++;
        // cout<<"循环结果"<& postorder) {
        return dfs(postorder,0,postorder.size()-1);
    }
};