forked from luliyucoordinate/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0200.cpp
36 lines (35 loc) · 1.08 KB
/
0200.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
class Solution
{
public:
int numIslands(vector<vector<char>>& grid)
{
if (grid.empty()) return 0;
int result = 0;
for (unsigned int i = 0; i < grid.size(); ++i)
{
for (unsigned int j = 0; j < grid[0].size(); ++j)
{
if (grid[i][j] == '1')
{
result++;
_numIslands(grid, i, j);
}
}
}
return result;
}
private:
void _numIslands(vector<vector<char>>& grid, unsigned int r, unsigned int c)
{
grid[r][c] = '0';
if (0 < r and grid[r - 1][c] == '1') _numIslands(grid, r - 1, c);
if (0 < c and grid[r][c - 1] == '1') _numIslands(grid, r, c - 1);
if (c < grid[0].size() - 1 and grid[r][c + 1] == '1') _numIslands(grid, r, c + 1);
if (r < grid.size() - 1 and grid[r + 1][c] == '1') _numIslands(grid, r + 1, c);
}
};