mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-12 17:05:15 +08:00
43 lines
1.1 KiB
HTML
43 lines
1.1 KiB
HTML
<p>给你一个由 <code>'1'</code>（陆地）和 <code>'0'</code>（水）组成的的二维网格，请你计算网格中岛屿的数量。</p>
|
||
|
||
<p>岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。</p>
|
||
|
||
<p>此外，你可以假设该网格的四条边均被水包围。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>grid = [
|
||
['1','1','1','1','0'],
|
||
['1','1','0','1','0'],
|
||
['1','1','0','0','0'],
|
||
['0','0','0','0','0']
|
||
]
|
||
<strong>输出：</strong>1
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>grid = [
|
||
['1','1','0','0','0'],
|
||
['1','1','0','0','0'],
|
||
['0','0','1','0','0'],
|
||
['0','0','0','1','1']
|
||
]
|
||
<strong>输出：</strong>3
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>m == grid.length</code></li>
|
||
<li><code>n == grid[i].length</code></li>
|
||
<li><code>1 <= m, n <= 300</code></li>
|
||
<li><code>grid[i][j]</code> 的值为 <code>'0'</code> 或 <code>'1'</code></li>
|
||
</ul>
|