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

finally it clicked for d9p2

Browse Source
This commit is contained in:
Stefan Harmuth 2020-12-10 15:28:17 +01:00
parent 490978ff9b
commit cd78620ec3
1 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
day09.py
View File

@ -1,5 +1,4 @@
import aoclib import aoclib
import itertools
DAY = 9 DAY = 9
TEST_SOLUTION_PART1 = 127 TEST_SOLUTION_PART1 = 127
@ -34,13 +33,15 @@ def part2(test_mode=False):
my_input = aoclib.getInputAsArray(day=DAY, return_type=int, test=test_mode) my_input = aoclib.getInputAsArray(day=DAY, return_type=int, test=test_mode)
sum_to_find = part1(test_mode) sum_to_find = part1(test_mode)
for start_index in range(0, len(my_input)): start_index = 0
for stop_index in range(start_index + 1, len(my_input) - start_index - 1): stop_index = 1
thisSum = sum(my_input[start_index:stop_index]) thisSum = sum(my_input[start_index:stop_index])
while thisSum != sum_to_find:
if thisSum > sum_to_find: if thisSum > sum_to_find:
break start_index += 1
else:
stop_index += 1
thisSum = sum(my_input[start_index:stop_index])
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