6/4-6/10 CareerCup 8.5

Implement an algorithm to print all valid (e.g., properly opened and closed) combinations of n-pairs of parentheses.
EXAMPLE:
input: 3 (e.g., 3 pairs of parentheses)
output: ()()(), ()(()), (())(), ((()))

冒个泡
https://github.com/yuren12345/careercup/blob/master/careercup8.5.cpp

这道题是不是有问题呢？
例子的output是不是缺了 (()()) 呢？

solution。。。
就用正常的回溯加一点剪枝吧

https://github.com/285845348/CPP/blob/master/CCP8/CCP8.5.py

https://gist.github.com/3547340

Tip: 从char[] 创建String，用new String()即可。

https://gist.github.com/GTCoder/8094020