Add 2023 Day 6 Part 2 solution

palinkiewicz · palinkiewicz · commit f25394cfcd1f · 2023-12-06T19:13:42.000+01:00
diff --git a/adventofcode2023/Day06.kt b/adventofcode2023/Day06.kt
@@ -11,12 +11,22 @@ object Day06 {
         println(times.indices.map {
             var chargeTime = 1
             while (chargeTime * (times[it] - chargeTime) < distances[it]) chargeTime++
-            (times[it] + 1) - 2 * chargeTime
+            times[it] + 1 - 2 * chargeTime
         }.reduce { acc, x -> acc * x })
     }
+
+    fun part2(inputs: List<String>) {
+        val (time, distance) = inputs.map { line ->
+            line.replace("\\s+".toRegex(), " ").split(" ").drop(1).joinToString("").toLong()
+        }
+        var chargeTime = 1
+        while (chargeTime * (time - chargeTime) < distance) chargeTime++
+        println(time + 1 - 2 * chargeTime)
+    }
 }
 
 fun main() {
     val inputs = File("resources/adventofcode2023/Day06.txt").readLines()
     Day06.part1(inputs)
+    Day06.part2(inputs)
 }
