LeetCode/kt/minimum-time-visiting-all-points.kt
Matej Focko 2351dfd0ee
chore: unwrap one layer
Signed-off-by: Matej Focko <mfocko@redhat.com>
2023-12-12 14:36:00 +01:00

8 lines
275 B
Kotlin

class Solution {
fun minTimeToVisitAllPoints(points: Array<IntArray>): Int =
points.zip(points.drop(1)).sumOf { (a, b) ->
val (ax, ay) = a
val (bx, by) = b
Math.max((ax - bx).absoluteValue, (ay - by).absoluteValue)
}
}