32 lines
1.6 KiB
Markdown
32 lines
1.6 KiB
Markdown
|
<p>给定一个包含了一些 <code>0</code> 和 <code>1</code> 的非空二维数组 <code>grid</code> 。</p>
|
||
|
|
|
||
|
|
<p>一个 <strong>岛屿</strong> 是由一些相邻的 <code>1</code> (代表土地) 构成的组合，这里的「相邻」要求两个 <code>1</code> 必须在水平或者竖直方向上相邻。你可以假设 <code>grid</code> 的四个边缘都被 <code>0</code>（代表水）包围着。</p>
|
||
|
|
|
||
|
|
<p>找到给定的二维数组中最大的岛屿面积。(如果没有岛屿，则返回面积为 <code>0</code> 。)</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p><strong>示例 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>[[0,0,1,0,0,0,0,1,0,0,0,0,0],
|
||
|
|
[0,0,0,0,0,0,0,1,1,1,0,0,0],
|
||
|
|
[0,1,1,0,1,0,0,0,0,0,0,0,0],
|
||
|
|
[0,1,0,0,1,1,0,0,<strong>1</strong>,0,<strong>1</strong>,0,0],
|
||
|
|
[0,1,0,0,1,1,0,0,<strong>1</strong>,<strong>1</strong>,<strong>1</strong>,0,0],
|
||
|
|
[0,0,0,0,0,0,0,0,0,0,<strong>1</strong>,0,0],
|
||
|
|
[0,0,0,0,0,0,0,1,1,1,0,0,0],
|
||
|
|
[0,0,0,0,0,0,0,1,1,0,0,0,0]]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p>对于上面这个给定矩阵应返回 <code>6</code>。注意答案不应该是 <code>11</code> ，因为岛屿只能包含水平或垂直的四个方向的 <code>1</code> 。</p>
|
||
|
|
|
||
|
|
<p><strong>示例 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>[[0,0,0,0,0,0,0,0]]</pre>
|
||
|
|
|
||
|
|
<p>对于上面这个给定的矩阵, 返回 <code>0</code>。</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p><strong>注意: </strong>给定的矩阵<code>grid</code> 的长度和宽度都不超过 50。</p>
|
||
|
|
<div><div>Related Topics</div><div><li>深度优先搜索</li><li>广度优先搜索</li><li>并查集</li><li>数组</li><li>矩阵</li></div></div>\n<div><li>👍 505</li><li>👎 0</li></div>
|