package q1226

func abs(i int) int {
	if i < 0 {
		return -i
	}
	return i
}

func minTimeToVisitAllPoints(points [][]int) int {
	time := 0
	for i := 0; i < len(points)-1; i++ {
		cur, next := points[i], points[i+1]
		dx, dy := abs(cur[0]-next[0]), abs(cur[1]-next[1])
		time += max(dx, dy)
	}
	return time
}

var _ = minTimeToVisitAllPoints