摘要: 描述: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 @ 2018-09-23 17:55 子龙_子龙 阅读(9) 评论(0) 推荐(0) 编辑