-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathh1568.py
37 lines (31 loc) · 1.21 KB
/
h1568.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
class Solution:
def minDays(self, grid: List[List[int]]) -> int:
def island(i: int, j: int, visited: Set[Tuple[int, int]]) -> None :
if not (0 <= i < len(grid)) or \
not (0 <= j < len(grid[0])) or \
(i, j) in visited or \
not grid[i][j]:
return
visited.add((i, j))
island(i - 1, j, visited)
island(i + 1, j, visited)
island(i, j - 1, visited)
island(i, j + 1, visited)
def moreThanOneIsland(x: int, y: int) -> bool :
islandFnd = False
visited = set([(x, y)])
for i in range(len(grid)) :
for j in range(len(grid[0])) :
if grid[i][j] and (i, j) not in visited :
if islandFnd :
return True
island(i, j, visited)
islandFnd = True
return not islandFnd
if moreThanOneIsland(-1, -1) :
return 0
for i in range(len(grid)) :
for j in range(len(grid[0])) :
if grid[i][j] and moreThanOneIsland(i, j) :
return 1
return 2