题目选自洛谷P1259 递归字符串倒序输出？我们先分析一下样例 ooooooo*******--oooooo--******o* oooooo******--o*ooooo--*****o*o* ooooo*****--o*o*oooo--****o*o*o* oooo****--o*o*o*ooo--***o*o*o*o*ooo*o**--*o*o*o* o--*o**oo*o*o*o* o*o*o*--o*o*o*o* --o*o*o*o*o*o*o*

leetCode原题： Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, givenn= 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()&#