-
Notifications
You must be signed in to change notification settings - Fork 0
/
200numberofislands.cpp
71 lines (63 loc) · 1.46 KB
/
200numberofislands.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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
//Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
//
//Example 1:
//11110
//11010
//11000
//00000
//
//Answer: 1
//
//Example 2:
//11000
//11000
//00100
//00011
//
//Answer: 3
//
void setadjacenttozero(vector<vector<char>>&grid, int i, int j)
{
int n = grid.size(), m = grid[0].size();
grid[i][j] = '0';
if ( i > 0 && grid[i-1][j] == '1')
{
setadjacenttozero(grid, i-1, j);
}
if ( i+1 < n && grid[i+1][j] == '1')
{
setadjacenttozero(grid, i+1, j);
}
if ( j > 0 && grid[i][j-1] == '1')
{
setadjacenttozero(grid, i, j-1);
}
if ( j+1 < m && grid[i][j+1] == '1')
{
setadjacenttozero(grid, i, j+1);
}
}
class Solution {
public:
int numIslands(vector<vector<char>>& grid)
{
if (0 == grid.size() || 0 == grid[0].size())
{
return 0;
}
int n = grid.size(), m = grid[0].size();
int count = 0;
for(int i = 0; i < n; i++)
{
for ( int j = 0; j < m; j++)
{
if ( grid[i][j] == '1')
{
count++;
setadjacenttozero(grid, i, j);
}
}
}
return count;
}
};