摘要: 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 @ 2016-12-29 10:43 不思蜀 阅读(190) 评论(0) 推荐(0) 编辑