22. Generate Parentheses - LeetCode Solution


Backtracking String

Python Code:

class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
        
        a = []
        
        
        actual = n
        def trav(n, b, i, j):
            if len(b) == 2*n:
                a.append(b)
                return 
            
            for k in range(i, n, 1):
                trav(n, b+"(", k+1, j)
            
            for l in range(j, i, 1):
                trav(n, b+")", i, l+1)
                
                

        
        trav(n, "", 0, 0)
        
        return a
            


Comments

Submit
1 Comments
  • 2/4/2024 11:54 - Europe/Moscow

String i = "";


More Questions

287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers
1624A - Plus One on the Subset
350A - TL
1487A - Arena
1520D - Same Differences
376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock
205A - Little Elephant and Rozdil
1609B - William the Vigilant
978B - File Name
1426B - Symmetric Matrix
732B - Cormen --- The Best Friend Of a Man
1369A - FashionabLee
1474B - Different Divisors
1632B - Roof Construction
388A - Fox and Box Accumulation
451A - Game With Sticks
768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors