首页 > 代码库 > Generate Parentheses
Generate Parentheses
题目
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 void getParen(int left, int right, String str, List<String> list) { if (left == 0 && right == 0) { list.add(str); } else if (left == right) { str += "("; getParen(left - 1, right, str, list); } else { if (left > 0) { String strLeft = str + "("; getParen(left - 1, right, strLeft, list); } if (right > 0) { String strRight = str + ")"; getParen(left, right - 1, strRight, list); } } } public List<String> generateParenthesis(int n) { List<String> list = new ArrayList<String>(); String str = ""; getParen(n, n , str, list); return list; }
Generate Parentheses
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。