-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathk-th-symbol-in-grammar.py
85 lines (61 loc) · 2.18 KB
/
k-th-symbol-in-grammar.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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
class SolutionBruteForce:
def kthGrammar(self, N: int, K: int) -> int:
def nth_level(prev_row, levels):
if levels == 0:
return prev_row
row = []
for val in prev_row:
if val == 0:
row += [0, 1]
else:
row += [1, 0]
return nth_level(row, levels - 1)
return nth_level([0], N - 1)[K - 1]
class SolutionBruteForce2:
# Time ok, but memory error
def kthGrammar(self, N: int, K: int) -> int:
def nth_level(row, levels):
if levels == 0:
return row
return nth_level(
row + row[len(row) // 2 :] + row[: len(row) // 2], levels - 1
)
if N == 1:
return 0
return int(nth_level("01", N - 2)[K - 1])
class Solution:
def kthGrammar(self, N: int, K: int) -> int:
def dfs(level: int, value: int) -> int:
if level == 0:
# Leaf node found, return
return value
# Leaf nodes in this subtree
count = 2 ** level
if ((K - 1) % count) < count // 2:
# Go left, next node value is the same
return dfs(level - 1, value)
else:
# Go right, next node value inverted
return dfs(level - 1, 1 - value)
return dfs(N - 1, 0)
def kthGrammar2(self, N: int, K: int) -> int:
def nth_level(level: int, pos: int) -> int:
if level == 0:
return 0
return (pos + nth_level(level - 1, pos // 2)) % 2
return nth_level(N - 1, K - 1)
class TestSolution:
def setup(self):
self.sol = Solution()
def test_one(self):
assert self.sol.kthGrammar(1, 1) == 0
def test_custom1(self):
assert self.sol.kthGrammar(2, 1) == 0
def test_custom2(self):
assert self.sol.kthGrammar(2, 2) == 1
def test_custom3(self):
assert self.sol.kthGrammar(4, 5) == 1
def test_custom3(self):
assert self.sol.kthGrammar(5, 13) == 0
def test_custom4(self):
assert self.sol.kthGrammar(30, 434991989) == 0