Package g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination

Class Solution

java.lang.Object
g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination.Solution
public class Solution extends Object
1293 - Shortest Path in a Grid with Obstacles Elimination.<p>Hard</p> <p>You are given an <code>m x n</code> integer matrix <code>grid</code> where each cell is either <code>0</code> (empty) or <code>1</code> (obstacle). You can move up, down, left, or right from and to an empty cell in <strong>one step</strong>.</p> <p>Return <em>the minimum number of <strong>steps</strong> to walk from the upper left corner</em> <code>(0, 0)</code> <em>to the lower right corner</em> <code>(m - 1, n - 1)</code> <em>given that you can eliminate <strong>at most</strong></em> <code>k</code> <em>obstacles</em>. If it is not possible to find such walk return <code>-1</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/09/30/short1-grid.jpg" alt="" /></p> <p><strong>Input:</strong> grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]], k = 1</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong></p> <p>The shortest path without eliminating any obstacle is 10.</p> <p>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) -> <strong>(3,2)</strong> -> (4,2).</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/09/30/short2-grid.jpg" alt="" /></p> <p><strong>Input:</strong> grid = [[0,1,1],[1,1,1],[1,0,0]], k = 1</p> <p><strong>Output:</strong> -1</p> <p><strong>Explanation:</strong> We need to eliminate at least two obstacles to find such a walk.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == grid.length</code></li> <li><code>n == grid[i].length</code></li> <li><code>1 <= m, n <= 40</code></li> <li><code>1 <= k <= m * n</code></li> <li><code>grid[i][j]</code> is either <code>0</code> <strong>or</strong> <code>1</code>.</li> <li><code>grid[0][0] == grid[m - 1][n - 1] == 0</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • shortestPath

      public int shortestPath(int[][] grid, int k)