22.Generate Parentheses (String; Back-Track)
摘要：
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 @ 2015-08-05 18:49 joannae 阅读(181) 评论(0) 推荐(0) 编辑
