标签:
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Given n = 3
, a solution set is:
"((()))", "(()())", "(())()", "()(())", "()()()"
s
[LintCode] Generate Parentheses 生成括号
标签:
原文地址:http://www.cnblogs.com/grandyang/p/5683142.html