🎄Advent of Code - Day 6 ✨: tidy code

src/main/kotlin/AdventOfCode2023/day6/WaitForIt.kt

@@ -12,19 +12,21 @@ class WaitForIt : Puzzle("2023", "6") {
         }.zipWithNext().map {
             // Take the zipped lines (since we only have 2) and transform them into races.
             it.first.mapIndexed { index, i -> Race(i, it.second[index]) }
-        }.flatten().also { println("The input is $it") }
+        }.flatten().also {
+            println("The input is $it")
+        }
     }
 
     override fun partOne() {
-        val raceTimes = getRaceTimesPart1().map {
+        getRaceTimesPart1().map {
             // here we transform a race into a list of all the possible combinations that we can have
             (1..<it.raceTime).map { time -> Race((it.raceTime - time) * time, it.distance) }
         }.parallelStream().map {
             // Here we filter out the losing races
             it.filter { it.raceTime > it.distance }.count()
-        }.reduce { acc, i -> acc * i }.get()
-
-        println("The number of ways the record was beaten $raceTimes.")
+        }.reduce { acc, i -> acc * i }.get().also {
+            println("The number of ways the record was beaten $it.")
+        }
     }
 
     override fun partTwo() {
@@ -34,6 +36,8 @@ class WaitForIt : Puzzle("2023", "6") {
         }.map {
             // Here we filter out the losing races
             it.parallelStream().filter { it.raceTime > it.distance }.count()
-        }.reduce { acc, i -> acc * i }.also { println("The number of ways the record was beaten $it.") }
+        }.reduce { acc, i -> acc * i }.also {
+            println("The number of ways the record was beaten $it.")
+        }
     }
 }