LeetCode 1266https://leetcode-cn.com/problems/minimum-time-v

leetcode-cn.com/problems/mi…

import kotlin.math.abs
import kotlin.math.min

/**
 * Created by yanyongjun on 2020/2/14.
 */
class Solution {
    fun minTimeToVisitAllPoints(points: Array<IntArray>): Int {
        var path = 0
        for (i in 0 until points.size - 1) {
            path += getPath(points[i], points[i + 1])
        }
        return path
    }

    private fun getPath(pointA: IntArray, pointB: IntArray): Int {
        val x = abs(pointA[0] - pointB[0])
        val y = abs(pointA[1] - pointB[1])
        return abs(x - y) + min(x, y)
    }
}