1824. Minimum Sideway Jumps (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def minSideJumps(self, obstacles: List[int]) -> int:
        arr = [float("inf"), 1, 0, 1]
        for num in obstacles:
            arr[num] = float("inf")
            for i in range(1, 4):
                if num != i and arr[i] == float("inf"):
                    arr[i] = min(arr) + 1
        return min(arr)