leetcode1266

class Solution:
    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:
        n = len(points)
        sec = 0
        for i in range(n-1):
            cp = points[i]
            np = points[i+1]
            sec += max(abs(cp[0]-np[0]),abs(cp[1]-np[1]))
        return sec

贪心思想，每一个点移动到下一个点的时间，由其横纵坐标中较大的决定。