Last active
December 1, 2024 10:38
-
-
Save mikarapace/94c143f9380fabf9b531abbd9350126d to your computer and use it in GitHub Desktop.
Advent of Code 2024
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| with open('01-input.txt', 'r') as file: | |
| data = file.read() | |
| left_column = [] | |
| right_column = [] | |
| for line in data.split('\n'): | |
| split = line.split(' ') | |
| left_column.append(int(split[0])) | |
| right_column.append(int(split[1])) | |
| left_column.sort() | |
| right_column.sort() | |
| distance = 0 | |
| for i in range(len(left_column)): | |
| distance += abs(left_column[i] - right_column[i]) | |
| print(distance) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| with open('01-input.txt', 'r') as file: | |
| data = file.read() | |
| left_column = [] | |
| right_column = [] | |
| for line in data.split('\n'): | |
| split = line.split(' ') | |
| left_column.append(int(split[0])) | |
| right_column.append(int(split[1])) | |
| similarity_score = 0 | |
| similarity_map = dict() | |
| for i in range(len(left_column)): | |
| left_number = left_column[i] | |
| if left_number in similarity_map: | |
| similarity_score += similarity_map[left_number] | |
| else: | |
| occurences = 0 | |
| for j in range(len(right_column)): | |
| right_number = right_column[j] | |
| if left_number == right_number: | |
| occurences += 1 | |
| similarity_map[left_number] = left_number * occurences | |
| similarity_score += left_number * occurences | |
| print(similarity_score) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment