class Solution {
public int minTimeToVisitAllPoints(int[][] points) {
int sum = 0;
for (int i = 0; i < points.length - 1; i++) {
int left = Math.abs(points[i + 1][0] - points[i][0]);
int right = Math.abs(points[i + 1][1] - points[i][1]);
int max = Math.max(left, right);
sum += max;
}
return sum;
}
}
leetcode 1266. 访问所有点的最小时间
最新推荐文章于 2021-12-21 19:12:32 发布