forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
swim-in-rising-water.py
45 lines (37 loc) · 1.3 KB
/
swim-in-rising-water.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
# Time: O(n^2)
# Space: O(n^2)
class UnionFind(object):
def __init__(self, n):
self.set = range(n)
def find_set(self, x):
if self.set[x] != x:
self.set[x] = self.find_set(self.set[x]) # path compression.
return self.set[x]
def union_set(self, x, y):
x_root, y_root = map(self.find_set, (x, y))
if x_root == y_root:
return False
self.set[min(x_root, y_root)] = max(x_root, y_root)
return True
class Solution(object):
def swimInWater(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
n = len(grid)
positions = [None] * (n**2)
for i in xrange(n):
for j in xrange(n):
positions[grid[i][j]] = (i, j)
directions = ((-1, 0), (1, 0), (0, -1), (0, 1))
union_find = UnionFind(n**2)
for elevation in xrange(n**2):
i, j = positions[elevation]
for direction in directions:
x, y = i+direction[0], j+direction[1]
if 0 <= x < n and 0 <= y < n and grid[x][y] <= elevation:
union_find.union_set(i*n+j, x*n+y)
if union_find.find_set(0) == union_find.find_set(n**2-1):
return elevation
return n**2-1