摘要: 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:[ "((()))", "(()())", "(())()", "()(())", "... 阅读全文
posted @ 2017-01-04 22:37 copperface 阅读(158) 评论(0) 推荐(0) 编辑