Question Description:
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Examples:
Example 1:
Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]
Example 2:
Input: n = 1
Output: ["...
