Leetcode--Generate Parentheses

主要考察栈的理解

    static vector<string> generateParenthesis(int n) {
        vector<string> res;
        addingpar(res, );
        return res;
    }

    static void addingpar(vector<string> &v, string str, int n, int m) {
         && m == ) {
            v.push_back(str);
            return;
        }
        )
            addingpar(v, str + );
        )
            addingpar(v, str + , m + );
    }