-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNumber of Islands.py
54 lines (43 loc) · 1.27 KB
/
Number of 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
45
46
47
48
49
50
51
52
53
54
'''
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:
Input:
11110
11010
11000
00000
Output: 1
Example 2:
Input:
11000
11000
00100
00011
Output: 3
'''
class Solution(object):
def numIslands(self, grid):
"""
:type grid: List[List[str]]
:rtype: int
"""
res = 0
if not grid:
return res
for i in xrange(len(grid)):
for j in xrange(len(grid[i])):
if grid[i][j] == '1':
res += 1
self.fill(grid, i, j)
return res
def fill(self, grid, x, y):
vec = [(x, y)]
while len(vec) > 0:
tmpx, tmpy = vec.pop()
grid[tmpx][tmpy] = '0'
for i, j in [(1, 0), (-1, 0), (0, 1), (0, -1)]:
tmpxx = tmpx + i
tmpyy = tmpy + j
if 0 <= tmpxx < len(grid) and 0 <= tmpyy < len(grid[tmpxx]):
if grid[tmpxx][tmpyy] == '1':
vec.append((tmpxx, tmpyy))