Leetcode: Generate Parentheses

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:"((()))", "(()())", "(())()", "()(())", "()()()"

又是把所有满足条件的结果存到一个ArrayList里面，之前也有类似的如Letter combination of a Phone Number这道题。这种类型的题其实形成了一个套路，套路就是，recursion参数包括最终结果的集合（ArrayList），input（String），递归层次level（int），某一条具体的路径Path

Code Ganker的做法，高手的代码就是简洁啊

 1 public ArrayList<String> generateParenthesis(int n) {
 2     ArrayList<String> res = new ArrayList<String>();
 3     if(n<=0)
 4         return res;
 5     helper(n,n,new String(),res);
 6     return res;
 7 }
 8 private void helper(int l, int r, String item, ArrayList<String> res)
 9 {
10     if(r<l)
11         return;
12     if(l==0 && r==0)
13     {
14         res.add(item);
15     }
16     if(l>0)
17         helper(l-1,r,item+"(",res);
18     if(r>0)
19         helper(l,r-1,item+")",res);
20 }

Leetcode: Generate Parentheses相关推荐

LeetCode Generate Parentheses
原题链接在这里:https://leetcode.com/problems/generate-parentheses/ 题目: Given n pairs of parentheses, write ...
[LeetCode] Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...
[leetcode]Generate Parentheses
题目: Given n pairs of parentheses, write a function to generate all combinations of well-formed paren ...
LeetCode:Generate Parentheses
题目链接 Given n pairs of parentheses, write a function to generate all combinations of well-formed pare ...
[leetcode] 22. Generate Parentheses
题目大意 https://leetcode.com/problems/generate-parentheses/description/ 22. Generate Parentheses Given ...
LeetCode算法入门- Generate Parentheses -day16
LeetCode算法入门- Generate Parentheses -day16 题目描述 Given n pairs of parentheses, write a function to gen ...
[CareerCup] 9.6 Generate Parentheses 生成括号
9.6 Implement an algorithm to print all valid (e.g., properly opened and closed) combinations of n-p ...
【LeetCode每天一题】Generate Parentheses(创造有效的括弧)
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...
【LeetCode从零单排】No22.Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parent ...
[LeetCode] #22 Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...

Leetcode: Generate Parentheses

Leetcode: Generate Parentheses相关推荐

最新文章

热门文章