forked from yunshuipiao/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
count_islands.py
44 lines (37 loc) · 826 Bytes
/
count_islands.py
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
"""
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
"""
def num_islands(grid):
count = 0
for i, row in enumerate(grid):
for j, col in enumerate(grid[i]):
if col == '1':
DFS(grid, i, j)
count += 1
return count
def DFS(grid, i, j):
if (i < 0 or i >= len(grid)) or (j < 0 or len(grid[0])):
return
if grid[i][j] != '1':
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)