Jake/advent_of_code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Optimize seed number search and print answer

Browse Source
This commit is contained in:
Jake Pullen
2023-12-05 08:30:03 +00:00
parent 17ae97c3b5
commit eb14bebf4c
1 changed files with 11 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
2023/day_5/part 2 solution.py
+11 -1
View File
@@ -8,6 +8,15 @@ with open(r'advent_of_code\2023\day_5\test_input.txt', 'r') as file:
# print(input) # print(input)
# big fat read me note
# big fat read me note
# big fat read me note
# this has a VERY LONG run time due to looping through what is probably millions of numbers
# JP to come back later and try to optimize this
# big fat read me note
# big fat read me note
# big fat read me note
# find the seed numbers # find the seed numbers
seed_numbers = input[0].split(':')[1].strip().split(' ') seed_numbers = input[0].split(':')[1].strip().split(' ')
#print(seed_numbers) #print(seed_numbers)
@@ -64,8 +73,9 @@ for seed in seed_map:
# Update smallest_location if a smaller location is found # Update smallest_location if a smaller location is found
if location < smallest_location: if location < smallest_location:
smallest_location = location smallest_location = location
print(smallest_location)
# Print the smallest location # Print the smallest location
print(smallest_location) print(f'answer: {smallest_location}')