Leetcodes Solutions 22 Generate Parentheses

zhuanlan.zhihu.com

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, given n = 3, a solution set is:

[ "((()))", "(()())", "(())()", "()(())", "()()()"]

思路1

利用遞歸.

利用兩個數：n還要加多少個（， m表示還要加多少個）

因為左右（）個數要相等，所有n-1 則m+1

class Solution{public: vector<string> generateParenthesis(int n){ vector<string> res; addingpar(res, "", n, 0); return res; } void addingpar(vector<string> &v, string str, int n, int m){ if(n == 0 && m == 0){ v.push_back(str); return; } if(m > 0) {addingpar(v, str+")", n, m-1);} if(n > 0) {addingpar(v, str+"(", n-1, m+1);} }} ;

推薦閱讀：