The Mindscaping Inc.
Sunday, December 20, 2015
22. Generate Parentheses
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 Code:
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment