-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path200. Number of Islands
54 lines (40 loc) · 1017 Bytes
/
200. Number of Islands
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
'''
200. Number of Islands
Medium
2247
83
Favorite
Share
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:
def numIslands(self, grid: List[List[str]]) -> int:
count = 0
for i in range(len(grid)):
for j in range(len(grid[i])):
if grid[i][j] == '1':
count += 1
self.dfs(i,j, grid)
return count
def dfs(self, i, j, grid):
if i < 0 or j < 0 or i > len(grid)-1 or j > len(grid[i])-1 or grid[i][j] != '1':
return
grid[i][j] = "*"
self.dfs(i-1, j, grid)
self.dfs(i+1, j, grid)
self.dfs(i, j-1, grid)
self.dfs(i, j+1, grid)