-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathPrison_Cells_After_N_Days.py
More file actions
43 lines (31 loc) · 1007 Bytes
/
Prison_Cells_After_N_Days.py
File metadata and controls
43 lines (31 loc) · 1007 Bytes
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
from typing import List
from copy import copy
from collections import defaultdict
class Solution:
def prisonAfterNDays(self, cells: List[int], N: int) -> List[int]:
# cells size is fixed
result = defaultdict(list)
for i in range(15):
result[i] = copy(cells)
org = copy(cells)
for j in range(1, 7):
if org[j - 1] != org[j + 1]:
cells[j] = 0
else:
cells[j] = 1
cells[0] = 0
cells[7] = 0
if N % 14 == 0:
return result[14]
return result[N % 14]
if __name__ == '__main__':
sol = Solution()
c1 = [0, 1, 0, 1, 1, 0, 0, 1]
n1 = 7
print(sol.prisonAfterNDays(c1, n1), [0, 0, 1, 1, 0, 0, 0, 0])
c2 = [1, 0, 0, 1, 0, 0, 1, 0]
n2 = 1000000000
print(sol.prisonAfterNDays(c2, n2))
c3 = [1, 0, 0, 1, 0, 0, 0, 1]
n3 = 826
print(sol.prisonAfterNDays(c3, n3), [0, 1, 1, 0, 1, 1, 1, 0])