Day 5

Author: Florian Rohrer

README.md

@@ -6,6 +6,7 @@
 |[Day 2: Rock Paper Scissors](https://adventofcode.com/2022/day/2)     |[py](/day02/main.py), [alt1](/day02/alt1.py), [alt2](/day02/alt2.py)|
 |[Day 3: Rucksack Reorganization](https://adventofcode.com/2022/day/3) |[py](/day03/main.py)|
 |[Day 4: Camp Cleanup](https://adventofcode.com/2022/day/4)            |[py](/day04/main.py)|
+|[Day 5: Supply Stacks](https://adventofcode.com/2022/day/5)           |[py](/day05/main.py)|
 
 My solutions from previous years:
 * [r0f1/adventofcode2020](https://github.com/r0f1/adventofcode2020)

day05/main.py

@@ -0,0 +1,21 @@
+with open("input.txt") as f:
+    lines = f.readlines()
+    
+idx = 0
+for i, l in enumerate(lines):
+    if len(l) == 1:
+        idx = i
+        break
+
+crates = list(zip(*[list(l[1::4]) for l in lines[i-2::-1]]))
+crates = [[k for k in c if k != ' '] for c in crates]
+
+moves = [l.split(" from ") for l in lines[idx+1:]]
+for a, b in moves:
+    idx_s, idx_t = [int(k)-1 for k in b.split(" to ")]
+    s, t = crates[idx_s], crates[idx_t]
+    r = [s.pop() for _ in range(int(a[5:]))]
+    #t.extend(r)      # Part 1
+    t.extend(r[::-1]) # Part 2
+
+print("".join(c[-1] for c in crates))