摘要: 题目描述: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set 阅读全文
posted @ 2016-03-08 22:10 skycore 阅读(146) 评论(0) 推荐(0) 编辑