## LeetCode:1266. Minimum Time Visiting All Points

On a plane there are n points with integer coordinates points[i] = [xi, yi]. Your task is to find the minimum time in seconds to visit all points.
You can move according to the next rules:
* In one second always you can either move vertically, horizontally by one unit or diagonally (it means to move one unit vertically and one unit horizontally in one second).
* You have to visit the points in the same order as they appear in the array.

Input: points = [[1,1],[3,4],[-1,0]]
Output: 7
Explanation: One optimal path is [1,1] -> [2,2] -> [3,3] -> [3,4] -> [2,3] -> [1,2] -> [0,1] -> [-1,0]
Time from [1,1] to [3,4] = 3 seconds
Time from [3,4] to [-1,0] = 4 seconds
Total time = 7 seconds

``````func minTimeToVisitAllPoints(points [][]int) int {
var xDiff, yDiff int
seconds := 0
for i:=0; i < (len(points)-1);i++ {
if xDiff = points[i+1] - points[i]; xDiff < 0{
xDiff = -xDiff
}
if yDiff = points[i+1] - points[i]; yDiff < 0{
yDiff = -yDiff
}
switch{
case xDiff == yDiff:
seconds += xDiff
case xDiff > yDiff:
seconds += xDiff
case xDiff < yDiff:
seconds += yDiff
}
}
return seconds
}``````