1825. Seek out MK average value

topic：

1824Minimum side jump number

answer：

I won’t

https://leetcode.cn/problems/minimum-sideway-jumps/solutions/2071617/cong-0-dao-1-de-0-1-bfspythonjavacgo-by-1m8z4/?orderBy=most_votes

Code：

class Solution:
    def minSideJumps(self, obstacles: List[int]) -> int:
        n = len(obstacles)
        dis = [[n] * 3 for _ in range(n)]
        dis[0][1] = 0
        q = deque([(0, 1)])  # starting point
        while True:
            i, j = q.popleft()
            d = dis[i][j]
            if i == n - 1: return d  # reach destination
            if obstacles[i + 1] != j + 1 and d < dis[i + 1][j]:  # To the right
                dis[i + 1][j] = d
                q.appendleft((i + 1, j))  # Add to the team
            for k in (j + 1) % 3, (j + 2) % 3:  # The other two other runways are enumerated（up/down）
                if obstacles[i] != k + 1 and d + 1 < dis[i][k]:
                    dis[i][k] = d + 1
                    q.append((i, k))  # Add to the tail