摘要: 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 @ 2019-01-19 10:26 Schwifty 阅读(183) 评论(0) 推荐(0)