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:

["((()))","(()())","(())()","()(())","()()()" ]
解題思路：本題就是個遞歸。
當左括號大于右括號的時候，可以選擇左或者右
當左括號等于右括號的時候選擇右=左 class Solution { public:void helper(vector<string>&res, int sum, int left, int right,string str){if(left+right==sum){if(left==right){res.push_back(str);}return ;}if(left<right)return;helper(res,sum,left+1,right,str+"(");if(left>right){helper(res,sum,left,right+1,str+")");}}vector<string> generateParenthesis(int n) {vector<string>res;helper(res,2*n,0,0,"");return res;} };

?

轉載于:https://www.cnblogs.com/tsunami-lj/p/7600583.html

總結

以上是生活随笔為你收集整理的22. Generate Parentheses的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。