LeetCode 筆記 - 1503. Last Moment Before All Ants Fall Out of a Plank

class Solution:
    def getLastMoment(self, n: int, left: List[int], right: List[int]) -> int:
        result = 0
        
        max_left = 0
        for l in left:
            max_left = max(max_left, l)

        min_right = n
        for r in right:
            min_right = min(min_right, r)

        result = max(max_left, n - min_right)

        return result