[leetcode]22. Generate Parentheses(Java)

最新推荐文章于 2024-10-31 16:16:13 发布

JacobGo

最新推荐文章于 2024-10-31 16:16:13 发布

阅读量412

点赞数

分类专栏： leetcode 文章标签： Generate Parentheses leetcode

本文链接：https://blog.csdn.net/zjkC050818/article/details/75349623

版权

leetcode 专栏收录该内容

130 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/generate-parentheses/#/description

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:

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

package go.jacob.day719;

import java.util.ArrayList;
import java.util.List;

public class Demo3 {
	List<String> res;

	public List<String> generateParenthesis(int n) {
		res = new ArrayList<String>();
		if (n <= 0)
			return res;
		generateParenthesis(n, "(", 2, 1);
		return res;
	}

	private void generateParenthesis(int n, String str, int left, int right) {
		//终止条件
		if (left > n && right > n) {
			res.add(str);
			return;
		}
		if (left > n)
			generateParenthesis(n, str + ")", left, right + 1);
		//左括号和右括号小用户最大值
		else if (right < left) {
			generateParenthesis(n, str + "(", left + 1, right);
			generateParenthesis(n, str + ")", left, right + 1);
		} else if (right == left)
			generateParenthesis(n, str + "(", left + 1, right);
	}
}