22. Generate Parentheses

最新推荐文章于 2020-06-21 15:30:54 发布

myfwjy

最新推荐文章于 2020-06-21 15:30:54 发布

阅读量174

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/myfwjy/article/details/53187888

版权

LeetCode 专栏收录该内容

91 篇文章 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:

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

思路：

深度优先算法。

public class Solution {
    public List<String> generateParenthesis(int n) {
        List<String> res = new ArrayList<String>();
	if (n <= 0)
		return res;
	String bracket = "";
	dfs(res, bracket, n, n);
	return res;
    }
    
    private void dfs(List<String> res, String bracket, int left,
		int right) {
	if(left > right){
		return;
	}
	if (left == 0 && right == 0) {
		res.add(bracket);
		return;
	}
	if (left > 0) {
		dfs(res, bracket + "(", left - 1, right);
	}
	if (right > 0) {
		dfs(res, bracket + ")", left, right - 1);
	}
    }
}