kageru/advent-of-code
1
0
Fork 0
Code Issues 1 Pull Requests Releases Wiki Activity

Shorten D6P1 in Kotlin

This commit is contained in:
kageru 2019-12-06 10:16:50 +01:00
parent 68f6629aa3
commit edcb443b4c
1 changed files with 5 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
2019/06/day06.kt
View File

@ -1,13 +1,8 @@
fun main() {
val input = generateSequence(::readLine)
.map { it.split(")") }
.groupBy { it[0] }
.mapValues{ it.value.map { it[1] } }
val rootNode = input.keys - input.values.flatten().toSet()
println("Part 1: ${countOrbiters(input, rootNode.first(), 0)}")
val input = generateSequence(::readLine).map { it.split(")") }.groupBy { it[0] }.mapValues{ it.value.map { it[1] } }
val rootNode = (input.keys - input.values.flatten().toSet()).first()
println("Part 1: ${countOrbiters(input, rootNode, 0)}")
}
fun <T>countOrbiters(graph: Map<T, List<T>>, key: T, acc: Int): Int {
return acc + (graph[key]?.map { countOrbiters(graph, it, acc+1) }?.sum() ?: 0)
}
fun <T>countOrbiters(graph: Map<T, List<T>>, key: T, acc: Int): Int =
acc + (graph[key]?.map { countOrbiters(graph, it, acc+1) }?.sum() ?: 0)