aaron/adventofcode2022
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix comments

Browse Source
This commit is contained in:
aaron
2022-12-06 16:47:14 +01:00
parent 7ba19b3579
commit fdb7fe64e6
1 changed files with 6 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
6/tuningtrouble.py
View File

@@ -1,16 +1,14 @@
from itertools import count
from aocd.models import Puzzle
from aocd import submit
def get_marker_pos(signal, N):
"""
iterate over input stream and find all the first occurence
where the Set from i to i+N equals N. This means there are
no duplicates within this particular range.
iterate over input signal and find the first occurence
where the set from i to i+N equals N. This means there
are no duplicates within this particular range.
"""
for i in count():
for i in range(0, len(signal)):
if len(set(signal[i : i + N])) == N:
return i + N
@@ -20,12 +18,12 @@ if __name__ == "__main__":
puzzle = Puzzle(year=2022, day=6)
signal = puzzle.input_data
# part a:
# part a: find marker with 4 different chars
answer_a = get_marker_pos(signal, 4)
print(f"{answer_a}")
submit(answer_a, part="a", day=6, year=2022)
# part b:
# part b: find marker with 14 different chars
answer_b = get_marker_pos(signal, 14)
print(f"{answer_b}")
submit(answer_b, part="b", day=6, year=2022)