Advertisement
1266. Minimum Time Visiting All Points
EasyView on LeetCode
1266.cs
C#
public class Solution
{
public int MinTimeToVisitAllPoints(int[][] points)
{
int ans = 0;
for (int i = 1; i < points.Length; ++i)
ans += Math.Max(Math.Abs(points[i][0] - points[i - 1][0]),
Math.Abs(points[i][1] - points[i - 1][1]));
return ans;
}
}Advertisement
Was this solution helpful?