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 {
private List<String> soluctionList = new ArrayList<>();
public List<String> generateParenthesis(int n) {
String s = "";
createParentheses(s,n,n); //这里想的是传入左括号剩余的数量,右括号剩余的数量
return soluctionList;
}
public void createParentheses(String s,int left,int right){
if(left == 0 && right == 0)
{
soluctionList.add(s);
}
if(left>0)
{
createParentheses(s + "(",left-1,right);
}
if(right>0)
{
createParentheses(s + ")",left,right-1);
}
}
}
但是输出的结果是有问题的,
((()))
(()())
(())()
(()))(
()(())
()()()
()())(
())(()
())()(
()))((
)((())
)(()()
)(())(
)()(()
)()()(
)())((
))((()
))(()(
))()((
)))(((
可以发现他们并不满足括号的特点,原因是右括号的条件跟左括号的条件是相似的,导致两边都是做一样的拼接
在没有左括号的情况下是不能有右括号的,并且拼接右括号时,右括号数目应该和左括号一致
class Solution {
private List<String> soluctionList = new ArrayList<>();
public List<String> generateParenthesis(int n) {
String s = "";
createParentheses(s,n,0); //左括号剩余的数量,右括号未与左括号匹配的数目
return soluctionList;
}
public void createParentheses(String s,int left,int right){
if(left == 0 && right == 0)
{
soluctionList.add(s);
}
if(left>0)
{
createParentheses(s + "(",left-1,right+1); //每用掉一个左括号,就要增添一个右括号给他使用
}
if(right>0)
{
createParentheses(s + ")",left,right-1);
}
}
}