leetcode - 1293. Shortest Path in a Grid with Obstacles Elimination

Description

You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step.

Return the minimum number of steps to walk from the upper left corner (0, 0) to the lower right corner (m - 1, n - 1) given that you can eliminate at most k obstacles. If it is not possible to find such walk return -1.

Example 1:

Input: grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]], k = 1
Output: 6
Explanation: 
The shortest path without eliminating any obstacle is 10.
The shortest path with one obstacle elimination at position (3,2) is 6. Such path is (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (3,2) -> (4,2).
1
2
3
4
5

Example 2:

Input: grid = [[0,1,1],[1,1,1],[1,0,0]], k = 1
Output: -1
Explanation: We need to eliminate at least two obstacles to find such a walk.
1
2
3

Constraints:

m == grid.length
n == grid[i].length
1 <= m, n <= 40
1 <= k <= m * n
grid[i][j] is either 0 or 1.
grid[0][0] == grid[m - 1][n - 1] == 0
1
2
3
4
5
6

Solution

BFS, but use the remaining time for removing rocks as the visited label. It’s always better if we reach the same point, and the remaining chance to remove rocks is larger.

Time complexity: $o(m\ast n)$
Space complexity: $o(m\ast n)$

Code

class Solution:
    def shortestPath(self, grid: List[List[int]], k: int) -> int:
        queue = collections.deque([(0, 0, k, 0)])
        visited = {}
        m, n = len(grid), len(grid[0])
        while queue:
            x, y, r, step = queue.popleft()
            if visited.get((x, y), -1) >= r:
                continue
            if x == m - 1 and y == n - 1:
                return step
            visited[(x, y)] = r
            for dz in (-1, 1):
                if 0 <= x + dz < m:
                    if grid[x + dz][y] == 0:
                        queue.append((x + dz, y, r, step + 1))
                    elif r - 1 >= 0:
                        queue.append((x + dz, y, r - 1, step + 1))
                if 0 <= y + dz < n:
                    if grid[x][y + dz] == 0:
                        queue.append((x, y + dz, r, step + 1))
                    elif r - 1 >= 0:
                        queue.append((x, y + dz, r - 1, step + 1))
        return -1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24