-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path00695-max_area_of_island.py
52 lines (38 loc) · 1.16 KB
/
00695-max_area_of_island.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
# 695: Max Area Of Island
# https://leetcode.com/problems/max-area-of-island
from typing import List
class Solution:
# SOLUTION
def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
m, n = len(grid), len(grid[0])
visit = set()
def dfs(i: int, j: int):
if (i < 0 or i == m or j < 0 or j == n or grid[i][j] == 0 or (i, j) in visit):
return 0
visit.add((i, j))
return \
1 + dfs(i + 1, j) \
+ dfs(i - 1, j) \
+ dfs(i, j + 1) \
+ dfs(i, j - 1)
result = 0
for r in range(m):
for c in range(n):
result = max(result, dfs(r, c))
return result
if __name__ == "__main__":
o = Solution()
# INPUT
grid = [
[0,0,1,0,0,0,0,1,0,0,0,0,0],
[0,0,0,0,0,0,0,1,1,1,0,0,0],
[0,1,1,0,1,0,0,0,0,0,0,0,0],
[0,1,0,0,1,1,0,0,1,0,1,0,0],
[0,1,0,0,1,1,0,0,1,1,1,0,0],
[0,0,0,0,0,0,0,0,0,0,1,0,0],
[0,0,0,0,0,0,0,1,1,1,0,0,0],
[0,0,0,0,0,0,0,1,1,0,0,0,0]
]
# OUTPUT
result = o.maxAreaOfIsland(grid)
print(result)