/********************************
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:
"((()))", "(()())", "(())()", "()(())", "()()()"
**********/
#include <iostream>
#include <vector>
#include <string>
using std::string;
using std::vector;
class Solution {
public:void created(vector<string> &result,string &str,int left_len,int n,int right_len){if(left_len ......
阅读全文