Refactor code for API (#3)

Co-authored-by: Mikael CAPELLE <mikael.capelle@thalesaleniaspace.com>
Co-authored-by: Mikaël Capelle <capelle.mikael@gmail.com>
Reviewed-on: #3

src/holt59/aoc/2021/day7.py

@@ -1,19 +1,22 @@
-import sys
+from typing import Any, Iterator
 
-positions = [int(c) for c in sys.stdin.read().strip().split(",")]
+from ..base import BaseSolver
 
-min_position, max_position = min(positions), max(positions)
 
-# part 1
-answer_1 = min(
-    sum(abs(p - position) for p in positions)
-    for position in range(min_position, max_position + 1)
-)
-print(f"answer 1 is {answer_1}")
+class Solver(BaseSolver):
+    def solve(self, input: str) -> Iterator[Any]:
+        positions = [int(c) for c in input.split(",")]
 
-# part 2
-answer_2 = min(
-    sum(abs(p - position) * (abs(p - position) + 1) // 2 for p in positions)
-    for position in range(min_position, max_position + 1)
-)
-print(f"answer 2 is {answer_2}")
+        min_position, max_position = min(positions), max(positions)
+
+        # part 1
+        yield min(
+            sum(abs(p - position) for p in positions)
+            for position in range(min_position, max_position + 1)
+        )
+
+        # part 2
+        yield min(
+            sum(abs(p - position) * (abs(p - position) + 1) // 2 for p in positions)
+            for position in range(min_position, max_position + 1)
+        )