/*岛屿数量
给定一个由 '1'(陆地)和 '0'(水)组成的的二维网格地图,计算岛屿的数量。一个岛被水包围,并且通过水平或垂直连接相邻的陆地而形成,但是不通过对角线连接。
图中有3个岛
DFS遍历
问题函数定义:
cpp
int numIslands(vector<vector<char>>&grid);
裁判测试程序样例:*/
#include <iostream>
#include <vector>
using namespace std;
void dfs(vector<vector<char>>& grid, int i, int j) {
if (i < 0 || i >= grid.size() || j < 0 || j >= grid[0].size() || grid[i][j] == '0') {
return;
}
grid[i][j] = '0';
dfs(grid, i + 1, j);
dfs(grid, i - 1, j);
dfs(grid, i, j + 1);
dfs(grid, i, j - 1);
}
int numIslands(vector<vector<char>>& grid) {
int count = 0;
for (int i = 0; i < grid.size(); ++i) {
for (int j = 0; j < grid[0].size(); ++j) {
if (grid[i][j] == '1') {
count++;
dfs(grid, i, j);
}
}
}
return count;
}
int main() {
vector<vector<char>> grid = {
{'1', '1', '0', '0', '0'},
{'1', '1', '0', '0', '0'},
{'0', '0', '1', '0', '0'},
{'0', '0', '0', '1', '1'}
};
int islands = numIslands(grid);
cout << "Number of Islands: " << islands << endl;
return 0;
}
/*输入样例:
(无需输入)
输出样例:
Number of Islands : 3*/