leetcode-164周赛-1266-访问所有点的最小时间

题目描述：

自己的解：

class Solution:
    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:
        res =
        n = len(points)
        if n < :
            return res
        pre = points[]
        for i,v in enumerate(points):
            if i>:
                res += min(abs(v[]-pre[]),abs(v[]-pre[])) + abs(abs(v[]-pre[])-abs(v[]-pre[]))
            pre = v
        return res

优化：

class Solution:
    def minTimeToVisitAllPoints(self, ps: List[List[int]]) -> int:
        n = len(ps)
        ans =
        for i in range(n - ):
            dx = abs(ps[i + ][] - ps[i][])
            dy = abs(ps[i + ][] - ps[i][])
            ans += max(dx, dy)
        return ans