题目
给你一个由 ‘1’(陆地)和 ‘0’(水)组成的的二维网格,请你计算网格中岛屿的数量。
岛屿总是被水包围,并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外,你可以假设该网格的四条边均被水包围。
示例 1:
输入:grid = [
["1","1","1","1","0"],
["1","1","0","1","0"],
["1","1","0","0","0"],
["0","0","0","0","0"]
]
输出:1
示例 2:
输入:grid = [
["1","1","0","0","0"],
["1","1","0","0","0"],
["0","0","1","0","0"],
["0","0","0","1","1"]
]
输出:3
提示:
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] 的值为 ‘0’ 或 ‘1’
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/number-of-islands
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路
遍历矩阵,如果遇到字符 '1'
,岛屿数量 + 1,同时调用一次 DFS 把该岛屿的所有坐标变为 0(这样就不需要额外的矩阵来记录是否遍历过此地了)
注意这个题矩阵元素是 char
类型
时间复杂度:
O
(
m
n
)
O(mn)
O(mn)
空间复杂度:
O
(
1
)
O(1)
O(1)
C++ 代码
class Solution {
public:
int numIslands(vector<vector<char>>& grid) {
if (grid.empty() || grid[0].empty())
return 0;
Y = grid.size();
X = grid[0].size();
int ans = 0;
for (int y = 0; y < Y; ++y) {
for (int x = 0; x < X; ++x) {
if (grid[y][x] == '1') {
++ans;
DFS(grid, y, x);
}
}
}
return ans;
}
void DFS(vector<vector<char>>& grid, int y, int x) {
grid[y][x] = '0';
for (int i = 0; i < 4; ++i) {
int newY = y + direction[i];
int newX = x + direction[i + 1];
if (newY >= 0 && newY < Y && newX >= 0 && newX < X
&& grid[newY][newX] == '1')
DFS(grid, newY, newX);
}
}
private:
const vector<int> direction{0, 1, 0, -1, 0};
int Y, X;
};