1266_minimum_time_visiting_all_points.py

class Solution:
    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:

        def cal_points_second(point_A: List[int], point_B: List[int]) -> int:
            return max(abs(point_A[0]-point_B[0]), abs(point_A[1]-point_B[1]))
        
        ans = 0
        for i in range(len(points)-1):
            ans += cal_points_second(points[i], points[i+1])
        return ans

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''