-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path200.py
32 lines (32 loc) · 820 Bytes
/
200.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
class Solution(object):
def numIslands(self, grid):
"""
:type grid: List[List[str]]
:rtype: int
"""
len1 = len(grid)
if len1 == 0:
return 0
len2 = len(grid[0])
if len2 == 0:
return 0
def dfs(m, n):
if grid[m][n] == '0':
return
grid[m][n] = '0'
if m > 0:
dfs(m - 1, n)
if m < len1 - 1:
dfs(m + 1, n)
if n > 0:
dfs(m, n - 1)
if n < len2 - 1:
dfs(m, n + 1)
return
res = 0
for i in range(len1):
for j in range(len2):
if grid[i][j] == '1':
res += 1
dfs(i, j)
return res