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/2015/day9.py

@@ -1,27 +1,28 @@
 import itertools
-import sys
 from collections import defaultdict
-from typing import cast
+from typing import Any, Iterator, cast
 
 import parse  # type: ignore
 
-lines = sys.stdin.read().splitlines()
+from ..base import BaseSolver
 
-distances: dict[str, dict[str, int]] = defaultdict(dict)
-for line in lines:
-    origin, destination, length = cast(
-        tuple[str, str, int],
-        parse.parse("{} to {} = {:d}", line),  # type: ignore
-    )
-    distances[origin][destination] = distances[destination][origin] = length
 
-distance_of_routes = {
-    route: sum(distances[o][d] for o, d in zip(route[:-1], route[1:]))
-    for route in map(tuple, itertools.permutations(distances))
-}
+class Solver(BaseSolver):
+    def solve(self, input: str) -> Iterator[Any]:
+        lines = input.splitlines()
 
-answer_1 = min(distance_of_routes.values())
-print(f"answer 1 is {answer_1}")
+        distances: dict[str, dict[str, int]] = defaultdict(dict)
+        for line in lines:
+            origin, destination, length = cast(
+                tuple[str, str, int],
+                parse.parse("{} to {} = {:d}", line),  # type: ignore
+            )
+            distances[origin][destination] = distances[destination][origin] = length
 
-answer_2 = max(distance_of_routes.values())
-print(f"answer 2 is {answer_2}")
+        distance_of_routes = {
+            route: sum(distances[o][d] for o, d in zip(route[:-1], route[1:]))
+            for route in map(tuple, itertools.permutations(distances))
+        }
+
+        yield min(distance_of_routes.values())
+        yield max(distance_of_routes.values())