LeetCode: Generate Parentheses
摘要:
Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()()()"最开始想的是,先产生n-1的情况,然后在n-1中的每个string的前面,后面加上()以及用()扩住整个string。 阅读全文
posted @ 2014-01-13 10:10 longhorn 阅读(186) 评论(0) 推荐(0) 编辑