给你一个由 '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'
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int numIslands(vector<vector<char>>& grid) {
int count = 0;
vector<vector<bool>> isCheck(grid.size(), vector<bool>(grid[0].size(), false)); /* 是否已经检查 */
for (int i = 0; i < grid.size(); i++) {
for (int j = 0; j < grid[i].size(); j++) {
if (grid[i][j] == '1' && isCheck[i][j] == false) {
backtrace(grid, isCheck, i, j);
count++;
}
}
}
return count;
}
void backtrace(vector<vector<char>>& grid, vector<vector<bool>>& chkRect, int x, int y) {
if (x < 0 || y < 0 || x >= grid.size() || y >= grid[x].size()) {
return;
}
if (grid[x][y] == '1' && chkRect[x][y] == false) {
chkRect[x][y] = true;
backtrace(grid, chkRect, x + 1, y);
backtrace(grid, chkRect, x - 1, y);
backtrace(grid, chkRect, x, y + 1);
backtrace(grid, chkRect, x, y - 1);
}
}
};
int main() {
Solution* ps = new Solution();
vector<vector<char>>grid = {
{'1', '1', '1', '1', '0'},
{'1', '1', '0', '1', '0'},
{'1', '1', '0', '0', '0'},
{'0', '0', '0', '0', '0'}
};
cout << ps->numIslands(grid) << endl;
system("pause");
return 0;
}