mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-08 08:51:42 +08:00
存量题库数据更新
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
<p>Return <em>the size of the largest <strong>island</strong> in</em> <code>grid</code> <em>after applying this operation</em>.</p>
|
||||
|
||||
|
||||
|
||||
|
||||
<p>An <strong>island</strong> is a 4-directionally connected group of <code>1</code>s.</p>
|
||||
|
||||
|
||||
@@ -13,14 +13,14 @@
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
|
||||
|
||||
|
||||
<pre>
|
||||
|
||||
<strong>Input:</strong> grid = [[1,0],[0,1]]
|
||||
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Output:</strong> 3
|
||||
|
||||
<strong>Explanation:</strong> Change one 0 to 1 and connect two 1s, then we get an island with area = 3.
|
||||
|
||||
|
Reference in New Issue
Block a user