题目

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:

"((()))", "(()())", "(())()", "()(())", "()()()"

代码

For 2, it should place one "()" and add another one insert it but none tail it,

'(' f(1) ')' f(0)

or add none insert it but tail it by another one,

'(' f(0) ')' f(1)

Thus for n, we can insert f(i) and tail f(j) and i+j=n-1,

'(' f(i) ')' f(j)

public List<String> generateParenthesis(int n) {List<String> result = new ArrayList<String>();if (n == 0) {result.add("");} else {for (int i = n - 1; i >= 0; i--) {List<String> insertSub = generateParenthesis(i);List<String> tailSub = generateParenthesis(n - 1 - i);for (String insert : insertSub) {for (String tail : tailSub) {result.add("(" + insert + ")" + tail);}}}}return result;
}

/********************************

* 本文来自博客 “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/

【LeetCode从零单排】No22.Generate Parentheses相关推荐

【LeetCode每天一题】Generate Parentheses(创造有效的括弧)
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...
【LeetCode从零单排】No198.House Robber No91.Decode Ways139 word break（动态规划典型应用）
1.题目一道典型的Dynamic Programming的题目. You are a professional robber planning to rob houses along a stree ...
【LeetCode从零单排】No118 Pascal's Triangle
题目 Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, R ...
【LeetCode从零单排】No70.ClimbingStairs
题目爬楼梯问题,这是一道很有趣的问题.首先看题目: You are climbing a stair case. It takes n steps to reach to the top. Each ...
【LeetCode从零单排】No38.CountAndSay
题目 The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111 ...
【LeetCode从零单排】No26.Remove Duplicates from Sorted Array
题目题目要求:去除sort int数组中的重复项. Given a sorted array, remove the duplicates in place such that each ...
【LeetCode从零单排】No.7 Reverse Integer
前话今天开始励志刷一下leetcode上面的题目(还好这个网站没被TG和谐).从easy的开始,数一下差不多有40道,争取两个月搞定. 题目没想到做的第一道题目,虽然看似 ...
LeetCode 22. 括号生成（Generate Parentheses）
题目描述给出 n 代表生成括号的对数,请你写出一个函数,使其能够生成所有可能的并且有效的括号组合. 例如,给出 n =3,生成结果为: ["((()))","(()() ...
【LeetCode从零单排】No118 Pascal#39;s Triangle
题目 Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, R ...

【LeetCode从零单排】No22.Generate Parentheses

题目

代码

【LeetCode从零单排】No22.Generate Parentheses相关推荐

最新文章

热门文章