22. Generate Parentheses (backTracking)
摘要：
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-04-24 06:51 joannae 阅读(250) 评论(0) 推荐(0) 编辑
