题目描述:
Given n pairs of parentheses, write afunction to generate all combinations of well-formed parentheses.
For example: given n = 3, a solution set is:
[
"((()))",
"(()())",
"(())()",
"()(())",
"()()()"
]
题目理解:
输入一个整数n,输入正确的包含n对括号的组合
测试用例:
功能测试:输入但与0的整数
特殊测试:输入0
分析:
1. 使用递归;
2. 初始值左括号个数是n,右括号个数是n,每增加一个括号,相应括号个数减1;
3. 当左括号数大于右括号数时,该括号组合错误,不能添加到List中;
4. 当左括号数等于0并且右括号数等于0时,说明组合字符串正确,添加到List中
解答(参考代码):
public List<String> generateParenthesis(int n) {
List<String> list = new ArrayList<String>();
generateOneByOne("", list, n, n);
return list;
}
public void generateOneByOne(String sublist, List<String> list, int left, int right){
if(left > right){
return;
}
if(left > 0){
generateOneByOne( sublist + "(" , list, left-1, right);
}
if(right > 0){
generateOneByOne( sublist + ")" , list, left, right-1);
}
if(left == 0 && right == 0){
list.add(sublist);
return;
}
}