imajinyun /
leetcode-php
| Conditions | 3 |
| Paths | 3 |
| Total Lines | 12 |
| Code Lines | 7 |
| Lines | 0 |
| Ratio | 0 % |
| Changes | 1 | ||
| Bugs | 0 | Features | 0 |
| 1 | <?php |
||
| 9 | public static function minTimeToVisitAllPoints(array $points): int |
||
| 10 | { |
||
| 11 | if (empty($points)) { |
||
| 12 | return 0; |
||
| 13 | } |
||
| 14 | [$ans, $n] = [0, count($points)]; |
||
| 15 | for ($i = 1; $i < $n; $i++) { |
||
| 16 | [$prev, $curr] = [$points[$i - 1], $points[$i]]; |
||
| 17 | $ans += max(abs($curr[0] - $prev[0]), abs($curr[1] - $prev[1])); |
||
| 18 | } |
||
| 19 | |||
| 20 | return $ans; |
||
| 21 | } |
||
| 23 |
