-
Notifications
You must be signed in to change notification settings - Fork 0
/
22.py
54 lines (42 loc) · 1.31 KB
/
22.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
'''
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Example 1:
Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]
Example 2:
Input: n = 1
Output: ["()"]
Constraints:
1 <= n <= 8
'''
# https://leetcode.com/problems/generate-parentheses/
import unittest
def generate_parentheses(n):
def backtrack(s, left, right):
if len(s) == 2 * n:
result.append(s)
return
if left < n:
backtrack(s + '(', left + 1, right)
if right < left:
backtrack(s + ')', left, right + 1)
result = []
backtrack('', 0, 0)
return result
class TestGenerateParentheses(unittest.TestCase):
def test_example1(self):
n = 3
expected = ["((()))","(()())","(())()","()(())","()()()"]
# Call the function that solves the problem
result = generate_parentheses(n)
# Assert that the result matches the expected output
self.assertEqual(result, expected)
def test_example2(self):
n = 1
expected = ["()"]
# Call the function that solves the problem
result = generate_parentheses(n)
# Assert that the result matches the expected output
self.assertEqual(result, expected)
if __name__ == '__main__':
unittest.main()