LeetCode – Generate Parentheses (Java)

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: “((()))”, “(()())”, “(())()”, “()(())”, “()()()” Java Solution 1 – DFS This solution is simple and clear. In the dfs() method, left stands for the remaining number of (, right stands … Read more