Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, givenn= 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()" Solution: 1publicclassSolution {2publicList<String> generateParenthesis(intn)...
Leetcode 22. Generate Parentheses https://leetcode.com/problems/generate-parentheses/ Medium Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, givenn= 3, a solution set is: [ "((()))", "(()())", "(())()", "()(()...
vector<string> generateParenthesis(intn) { res.clear();stringtmp;if(n==0)returnres; dfs(n,0,0, tmp);returnres; } };
1classSolution {2public:3vector<string>vi;4voidgenerateOne(intleft,intright,strings)5{6if(left==0)7{8vi.push_back(s+string(right,')'));9return;10}11if(left>=right)12generateOne(left-1,right,s+'(');13else14{15generateOne(left-1,right,s+'(');16generateOne(left,right-1,s+')...