leetcode -- Generate Parentheses
2013-07-14 15:16
411 查看
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:
典型的递归。一步步构造字符串。当左括号出现次数<n时,就可以放置新的左括号。当右括号出现次数小于左括号出现次数时,就可以放置新的右括号。
For example, given n = 3, a solution set is:
"((()))", "(()())", "(())()", "()(())", "()()()"
典型的递归。一步步构造字符串。当左括号出现次数<n时,就可以放置新的左括号。当右括号出现次数小于左括号出现次数时,就可以放置新的右括号。
public class Solution { public ArrayList<String> generateParenthesis(int n) { // Start typing your Java solution below // DO NOT write main() function ArrayList<String> result = new ArrayList<String>(); if(n != 0){ generate(result, "", 0, 0, 0, n); } return result; } public void generate(ArrayList<String> result, String tmp, int deep, int left, int right, int n){ if(deep == 2 * n){ result.add(tmp); return; } if(left < n){ tmp += "("; generate(result, tmp, deep + 1, left + 1, right, n); tmp = tmp.substring(0, tmp.length() - 1); } if(right < left){ tmp += ")"; generate(result, tmp, deep + 1, left, right + 1, n); tmp = tmp.substring(0, tmp.length() - 1); } } }
相关文章推荐
- Leetcode 22 Generate Parentheses
- LeetCode----Generate Parentheses
- leetcode Generate Parentheses(Java)
- [LeetCode 题解]: Generate Parentheses
- leetcode — generate-parentheses
- LeetCode Generate Parentheses
- LeetCode (22)Generate Parentheses
- leetcode---Generate Parentheses
- LeetCode 22 - Generate Parentheses
- leetcode Generate Parentheses
- leetcode — generate-parentheses
- Leetcode: Generate Parentheses
- LeetCode 22 - Generate Parentheses
- LeetCode Online Judge 题目C# 练习 - Generate Parentheses
- Leetcode 22 - Generate Parentheses
- LeetCode Generate Parentheses 深度分析理解
- LeetCode 22 - Generate Parentheses
- Leetcode Generate Parentheses
- LeetCode题解:Generate Parentheses
- leetcode -- Generate Parentheses -- DFS题目重点