leetcode\MinimumTimeVisitingAllPoints

Complexity

Total Complexity

3

Size/Duplication

Total Lines	14
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	minTimeToVisitAllPoints()	0	12	3

<?php

declare(strict_types=1);

namespace leetcode;

class MinimumTimeVisitingAllPoints
{
    public static function minTimeToVisitAllPoints(array $points): int
    {
        if (empty($points)) {
            return 0;
        }
        [$ans, $n] = [0, count($points)];
        for ($i = 1; $i < $n; $i++) {
            [$prev, $curr] = [$points[$i - 1], $points[$i]];
            $ans += max(abs($curr[0] - $prev[0]), abs($curr[1] - $prev[1]));
        }

        return $ans;
    }
}