FilesExpand file tree

 master

/

gen_parentheses.py

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

24 lines (18 loc) · 687 Bytes

 master

/

gen_parentheses.py

Top

File metadata and controls

• Code
• Blame

24 lines (18 loc) · 687 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

#!/usr/bin/env python

'''

Leetcode: 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: "((()))", "(()())", "(())()", "()(())", "()()()"

'''

from __future__ import division

import random

def parentheses_combination(left, right):

if left == 0 and right == 0: yield ''

if left > 0:

for p in parentheses_combination(left-1, right):

yield '('+p

if right > left:

for p in parentheses_combination(left, right-1):

yield ')'+p

# Other ways?

if __name__ == '__main__':

for p in parentheses_combination(4,4): print p