• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2201_2300.s2258_escape_the_spreading_fire.readme.md Maven / Gradle / Ivy

2258\. Escape the Spreading Fire

Hard

You are given a **0-indexed** 2D integer array `grid` of size `m x n` which represents a field. Each cell has one of three values:

*   `0` represents grass,
*   `1` represents fire,
*   `2` represents a wall that you and fire cannot pass through.

You are situated in the top-left cell, `(0, 0)`, and you want to travel to the safehouse at the bottom-right cell, `(m - 1, n - 1)`. Every minute, you may move to an **adjacent** grass cell. **After** your move, every fire cell will spread to all **adjacent** cells that are not walls.

Return _the **maximum** number of minutes that you can stay in your initial position before moving while still safely reaching the safehouse_. If this is impossible, return `-1`. If you can **always** reach the safehouse regardless of the minutes stayed, return 109.

Note that even if the fire spreads to the safehouse immediately after you have reached it, it will be counted as safely reaching the safehouse.

A cell is **adjacent** to another cell if the former is directly north, east, south, or west of the latter (i.e., their sides are touching).

**Example 1:**

![](https://assets.leetcode.com/uploads/2022/03/10/ex1new.jpg)

**Input:** grid = [[0,2,0,0,0,0,0],[0,0,0,2,2,1,0],[0,2,0,0,1,2,0],[0,0,2,2,2,0,2],[0,0,0,0,0,0,0]]

**Output:** 3

**Explanation:** The figure above shows the scenario where you stay in the initial position for 3 minutes.

You will still be able to safely reach the safehouse.

Staying for more than 3 minutes will not allow you to safely reach the safehouse.

**Example 2:**

![](https://assets.leetcode.com/uploads/2022/03/10/ex2new2.jpg)

**Input:** grid = [[0,0,0,0],[0,1,2,0],[0,2,0,0]]

**Output:** -1

**Explanation:** The figure above shows the scenario where you immediately move towards the safehouse.

Fire will spread to any cell you move towards and it is impossible to safely reach the safehouse.

Thus, -1 is returned.

**Example 3:**

![](https://assets.leetcode.com/uploads/2022/03/10/ex3new.jpg)

**Input:** grid = [[0,0,0],[2,2,0],[1,2,0]]

**Output:** 1000000000

**Explanation:** The figure above shows the initial grid. Notice that the fire is contained by walls and you will always be able to safely reach the safehouse. Thus, 109 is returned. 

**Constraints:**

*   `m == grid.length`
*   `n == grid[i].length`
*   `2 <= m, n <= 300`
*   4 <= m * n <= 2 * 104
*   `grid[i][j]` is either `0`, `1`, or `2`.
*   `grid[0][0] == grid[m - 1][n - 1] == 0`