首页 > itarticle > generate parentheses

generate parentheses

admin 11月 13, 2020 0

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
2
3
4
5
6
7
 
[
  "((()))",
  "(()())",
  "(())()",
  "()(())",
  "()()()"
]

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
public class  {
    public List<String> generateParenthesis(int n) {
        List<String> list = new LinkedList<String>();
        backTrack(list,"",0,0,n);
        return list;
    }
    
    public void backTrack(List<String> list, String str, int left, int right, int num) {
        if(str.length() == num*2) {
            list.add(str);
            return;
        }
        if(left <num) {
            backTrack(list,str+"(",left+1,right,num);
        }
        if(right < left) {
            backTrack(list,str+")",left,right+1,num);
        }
    }
    
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能