1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>在给定的&nbsp;<code>m x n</code>&nbsp;网格<meta charset=\"UTF-8\" />&nbsp;<code>grid</code>&nbsp;中,每个单元格可以有以下三个值之一:</p>\n\n<ul>\n\t<li>值&nbsp;<code>0</code>&nbsp;代表空单元格;</li>\n\t<li>值&nbsp;<code>1</code>&nbsp;代表新鲜橘子;</li>\n\t<li>值&nbsp;<code>2</code>&nbsp;代表腐烂的橘子。</li>\n</ul>\n\n<p>每分钟,腐烂的橘子&nbsp;<strong>周围&nbsp;4 个方向上相邻</strong> 的新鲜橘子都会腐烂。</p>\n\n<p>返回 <em>直到单元格中没有新鲜橘子为止所必须经过的最小分钟数。如果不可能,返回&nbsp;<code>-1</code></em>&nbsp;。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/16/oranges.png\" style=\"height: 137px; width: 650px;\" /></strong></p>\n\n<pre>\n<strong>输入:</strong>grid = [[2,1,1],[1,1,0],[0,1,1]]\n<strong>输出:</strong>4\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>grid = [[2,1,1],[0,1,1],[1,0,1]]\n<strong>输出:</strong>-1\n<strong>解释:</strong>左下角的橘子(第 2 行, 第 0 列)永远不会腐烂,因为腐烂只会发生在 4 个正向上。\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre>\n<strong>输入:</strong>grid = [[0,2]]\n<strong>输出:</strong>0\n<strong>解释:</strong>因为 0 分钟时已经没有新鲜橘子了,所以答案就是 0 。\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>m == grid.length</code></li>\n\t<li><code>n == grid[i].length</code></li>\n\t<li><code>1 &lt;= m, n &lt;= 10</code></li>\n\t<li><code>grid[i][j]</code> 仅为&nbsp;<code>0</code>、<code>1</code>&nbsp;或&nbsp;<code>2</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 528,
"likes": 542,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Walls and Gates\", \"titleSlug\": \"walls-and-gates\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5899\\u4e0e\\u95e8\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"74.8K\", \"totalSubmission\": \"146.7K\", \"totalAcceptedRaw\": 74849, \"totalSubmissionRaw\": 146650, \"acRate\": \"51.0%\"}",
"stats": "{\"totalAccepted\": \"78.7K\", \"totalSubmission\": \"154.2K\", \"totalAcceptedRaw\": 78654, \"totalSubmissionRaw\": 154185, \"acRate\": \"51.0%\"}",
"hints": [],
"solution": {
"id": "144",