README_EN.md

994. Rotting Oranges

中文文档

Description

In a given grid, each cell can have one of three values:

<li>the value <code>0</code> representing an empty cell;</li>

<li>the value <code>1</code> representing a fresh orange;</li>

<li>the value <code>2</code> representing a rotten orange.</li>

Every minute, any fresh orange that is adjacent (4-directionally) to a rotten orange becomes rotten.

Return the minimum number of minutes that must elapse until no cell has a fresh orange.  If this is impossible, return -1 instead.

 

Example 1:

Input: [[2,1,1],[1,1,0],[0,1,1]]

Output: 4

Example 2:

Input: [[2,1,1],[0,1,1],[1,0,1]]

Output: -1

Explanation:  The orange in the bottom left corner (row 2, column 0) is never rotten, because rotting only happens 4-directionally.

Example 3:

Input: [[0,2]]

Output: 0

Explanation:  Since there are already no fresh oranges at minute 0, the answer is just 0.

 

Note:

<li><code>1 &lt;= grid.length &lt;= 10</code></li>

<li><code>1 &lt;= grid[0].length &lt;= 10</code></li>

<li><code>grid[i][j]</code> is only <code>0</code>, <code>1</code>, or <code>2</code>.</li>

Solutions

Python3

Java

...