kamov/advent-of-code
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Update day23.py

Browse source
This commit is contained in:
kamoshi 2020-12-23 15:24:07 +01:00 committed by GitHub
parent f238c38fbe
commit 8edeba4b48
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
2020/Python/day23.py
View file

@ -1,8 +1,9 @@
def move_cups(cups: list[int]) -> list[int]: def move_cups(cups: list[int]) -> list[int]:
cups_round = cups[:] cups_round = cups[:]
current = cups_round.pop(0) current = cups_round[0]
taken = [cups_round.pop(0), cups_round.pop(0), cups_round.pop(0)] taken = [cups_round[1], cups_round[2], cups_round[3]]
cups_round = cups_round[4:]
minimum, maximum = min(cups_round), max(cups_round) minimum, maximum = min(cups_round), max(cups_round)
@ -13,8 +14,7 @@ def move_cups(cups: list[int]) -> list[int]:
for i in range(len(cups_round)): for i in range(len(cups_round)):
if cups_round[i] == destination: if cups_round[i] == destination:
for taken_cup in reversed(taken): cups_round = cups_round[:i+1] + taken + cups_round[i+1:]
cups_round.insert(i+1, taken_cup)
break break
cups_round.append(current) cups_round.append(current)
@ -33,3 +33,6 @@ def solve_p1(order: str, n: int) -> str:
print(solve_p1("389547612", 100)) print(solve_p1("389547612", 100))
# TODO: Part 2 should use different data structure