airs of parentheses, write a function to generate   all combinations of well-formed parentheses.       For example, given n = 3, a solution set is:       [   "((()))",   "(()())",   "(())()",   "()(())",   "()()()"   ]   """

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 8SA
icon
Related questions
Question
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:
   
  [
  "((()))",
  "(()())",
  "(())()",
  "()(())",
  "()()()"
  ]
  """
   
   
  def generate_parenthesis_v1(n):
  defadd_pair(res, s, left, right):
  ifleft==0andright==0:
  res.append(s)
  return
  ifright>0:
  add_pair(res, s+")", left, right-1)
  ifleft>0:
  add_pair(res, s+"(", left-1, right+1)
   
  res= []
  add_pair(res, "", n, 0)
  returnres
   
   
  def generate_parenthesis_v2(n):
  defadd_pair(res, s, left, right):
  ifleft==0andright==0:
  res.append(s)
  ifleft>0:
  add_pair(res, s+"(", left-1, right)
  ifright>0andleft<right:
 

add_pair(res, s+")", left, right-1). 

 

Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Fibonacci algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr