150強訪談簡單

腐爛的橙子

“Rotting Oranges”問題的詳細指南和 Python 實作。

問題陳述

簡單

給定一個 m x n 網格,其中每個單元格可以具有以下三個值之一:

- 0 代表空白儲存格,

- 1 代表新鮮橙子,或

- 2 代表爛橘子。

每分鐘,任何與腐爛橙子在 4 方向上相鄰的新鮮橙子就會腐爛。

返回直到單元格中沒有新鮮橙子為止必須經過的最小分鐘數。如果不可能,則回傳 -1。

寫一個函數 orangesRotting(grid: List[List[int]]) -> int

約束條件
  • m == len(grid)
  • n == len(grid[i])
  • 1 <= m, n <= 10
  • grid[i][j] is 0, 1, or 2

範例

Example 1
Input
grid = [[2,1,1],[1,1,0],[0,1,1]]
Output
4
Explanation

Minute 0: rotten at (0,0). Fresh at (0,1), (0,2), (1,0), (1,1), (2,1), (2,2). Minute 1: fresh at (0,1) and (1,0) rot. Minute 2: fresh at (0,2) and (1,1) rot. Minute 3: fresh at (2,1) rot. Minute 4: fresh at (2,2) rot.

Example 2
Input
grid = [[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 adjacent to a rotten orange, so it stays fresh.

Need a Hint?
考慮使用特定於圖的資料結構,例如集合或堆。
Edge Cases to Watch
  • 空輸入結構
  • 單元素輸入
  • 大數值範圍

準備好解決了嗎?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在編輯器中開啟
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推薦的 Python 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。