【Leetcode】Generate Parent
【题目】
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:
"((()))", "(()())", "(())()", "()((
转载
2015-01-12 14:22:55 ·
321 阅读 ·
0 评论