public/aoc2020
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

day9 optimizations

Browse Source
This commit is contained in:
Stefan Harmuth 2020-12-10 05:49:09 +01:00
parent 9bd530c097
commit e666a78ba1
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
day09.py
View File

@ -15,8 +15,8 @@ def part1(test_mode=False):
current_buffer_size = len(number_buffer) current_buffer_size = len(number_buffer)
if current_buffer_size == max_buffer_size: if current_buffer_size == max_buffer_size:
found_sum = False found_sum = False
for combination in itertools.combinations(number_buffer, 2): for check_number in number_buffer:
if sum(combination) == number: if number - check_number in number_buffer:
found_sum = True found_sum = True
break break
@ -36,10 +36,11 @@ def part2(test_mode=False):
for start_index in range(0, len(my_input)): for start_index in range(0, len(my_input)):
for stop_index in range(start_index + 1, len(my_input) - start_index - 1): for stop_index in range(start_index + 1, len(my_input) - start_index - 1):
if my_input[stop_index] == sum_to_find: thisSum = sum(my_input[start_index:stop_index])
if thisSum > sum_to_find:
break break
if sum(my_input[start_index:stop_index]) == sum_to_find: if thisSum == sum_to_find:
return min(my_input[start_index:stop_index]) + max(my_input[start_index:stop_index]) return min(my_input[start_index:stop_index]) + max(my_input[start_index:stop_index])
return 0 return 0