[LeetCode]#1266. Minimum Time Visiting All Points

Environment: Python 3.7

Key technique: abs

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.

Example 1:

Example 2:

Constraints:

  • points.length == n
  • 1 <= n <= 100
  • points[i].length == 2
  • -1000 <= points[i][0], points[i][1] <= 1000

Analysis:

As below, we can find green road need 4 sec, and blue road need 2 sec. Namely, one “/” way can be replace two “| “and “ —”. We can converted as Max( (x2-x1),(y2-y1)).

Solution:

Submitted result:

Reference:

https://leetcode.com/problems/minimum-time-visiting-all-points/discuss/582967/Python-easy-to-read%3A-100-less-memory-faster-than-86

Interesting in any computer science.