Minimum Time Visiting All Points LeetCode solution in Python

1
# Runtime: 38 ms (Top 57.7%) | Memory: 13.27 MB (Top 67.6%)
2

3

4
class Solution:
5
    def minTimeToVisitAllPoints(self, points):
6
        res = 0
7
        n = len(points)
8
        for i in range(n - 1):
9
            dx = abs(points[i + 1][0] - points[i][0])
10
            dy = abs(points[i + 1][1] - points[i][1])
11
            res += max(dx, dy)
12
        return res
13

14

15
obj = Solution()
16
print(obj.minTimeToVisitAllPoints([[1, 1], [3, 4], [-1, 0]]))