chrisly42/advent-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Day 2: Revisited reg ex parsing, but it really turned out to be too complicated for me. Simplified part 1 a little.

Browse Source
This commit is contained in:
Chris Hodges 2023-12-02 07:42:10 +01:00
parent db8acdd483
commit 15d5e2ade8
1 changed files with 9 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
src/aoc2023/Day02.kt
View File

@ -57,21 +57,15 @@ Game 5: 6 red, 1 blue, 3 green; 2 blue, 1 red, 2 green
fun part1(input: List<String>): Int {
val limits = mapOf("red" to 12, "green" to 13, "blue" to 14)
return input.map {
val lg = it.split(":")
val sets = lg[1].trim().split(";")
var possible = lg[0].split(" ")[1].toInt()
exit@ for (s in sets) {
val boxes = s.trim().split(",")
for (b in boxes) {
val (num, col) = b.trim().split(" ")
if (num.toInt() > limits[col]!!) {
possible = 0
break@exit
}
}
}
"Game (\\d+): (.*)".toRegex().matchEntire(it)?.destructured
?.let { (id, game) ->
var possible = id.toInt()
game.replace(";", "").replace(",", "")
.split(" ").chunked(2)
.forEach { (num, col) -> if (num.toInt() > limits[col]!!) possible = 0 }
possible
}.sum()
}
}.sumOf { it!! }
}
fun part2(input: List<String>): Int {
@ -83,7 +77,7 @@ Game 5: 6 red, 1 blue, 3 green; 2 blue, 1 red, 2 green
val boxes = s.trim().split(",")
for (b in boxes) {
val (num, col) = b.trim().split(" ")
powerMap.merge(col, num.toInt()) { a, b -> max(a, b) }
powerMap.merge(col, num.toInt(), ::max)
}
}
powerMap.values.reduce { a, b -> a * b }