leetcode 1266. Minimum Time Visiting All Points

https://leetcode.com/problems/minimum-time-visiting-all-points/

 

class Solution:
    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:
        def sol(point1, point2):
            cost = 0
 
            def move1():
                nonlocal cost
                while point1[0] != point2[0] and point1[1] != point2[1]:
                    if point1[0] < point2[0] and point1[1] < point2[1]:
                        point1[0] += 1
                        point1[1] += 1
 
                    elif point1[0] < point2[0] and point1[1] > point2[1]:
                        point1[0] += 1
                        point1[1] -= 1
                    elif point1[0] > point2[0] and point1[1] > point2[1]:
                        point1[0] -= 1
                        point1[1] -= 1
                    elif point1[0] > point2[0] and point1[1] < point2[1]:
                        point1[0] -= 1
                        point1[1] += 1
 
                    cost += 1
 
            def move2():
                nonlocal cost
                if point1[0] == point2[0]:
                    cost += abs(point1[1] - point2[1])
                    point1[1] = point2[1]
                elif point1[1] == point2[1]:
                    cost += abs(point1[0] - point2[0])
                    point1[0] = point2[0]
 
            move1()
            move2()
            return cost
        answer = 0
 
 
        for i in range(1, len(points)):
            answer += sol(points[i - 1], points[i])
        
        return answer