-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday_02.py
34 lines (25 loc) · 1.04 KB
/
day_02.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
def is_safe(levels: list[int]) -> bool:
diffs = [levels[i + 1] - levels[i] for i in range(len(levels ) - 1)]
for diff in diffs:
if abs(diff) < 1 or abs(diff) > 3 or diff == 0:
return False
# Check that all diffs are positive or all diffs are negative
if all(diff > 0 for diff in diffs) or all(diff < 0 for diff in diffs):
return True
else:
return False
def count_safe(lvl_list:list[list[int]]) -> int:
return sum(is_safe(l) for l in lvl_list)
def is_safe_single_bad(levels: list[int]) -> bool:
for i in range(len(levels)):
if is_safe(levels[:i]+levels[i+1:]):
return True
return False
def count_safe_single_bad(levels: list[list[int]]) -> int:
return sum(is_safe(lvl) or is_safe_single_bad(lvl) for lvl in levels)
if __name__ == "__main__":
with open('./data/data_02.txt') as f:
data = f.read()
lvl_lists = [list(map(int, line.split())) for line in data.strip().splitlines()]
print(count_safe(lvl_lists))
print(count_safe_single_bad(lvl_lists))