blob: 96b8e0ba3683f64e680db705372f516b2110ee57 (
plain)
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
|
#include "leetcode.h"
class Solution {
public:
int numIslands(vector<vector<char>> &grid) {
int islands = 0;
for (int i = 0; i < grid.size(); i++) {
for (int j = 0; j < grid[0].size(); j++) {
if (grid[i][j] == '1') {
dfs(grid, i, j);
++islands;
}
}
}
return islands;
}
private:
void dfs(vector<vector<char>> &grid, int i, int j) {
if (i < 0 || i >= grid.size() || j < 0 || j >= grid[0].size())
return;
if (grid[i][j] == '2' || grid[i][j] == '0')
return;
grid[i][j] = '2';
dfs(grid, i + 1, j);
dfs(grid, i, j + 1);
dfs(grid, i - 1, j);
dfs(grid, i, j + 1);
}
};
|