-
Notifications
You must be signed in to change notification settings - Fork 1
/
LeetCode-407-Trapping-Rain-Water-II.java
45 lines (38 loc) · 1.57 KB
/
LeetCode-407-Trapping-Rain-Water-II.java
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
class Solution {
/*
https://leetcode.com/problems/trapping-rain-water-ii/discuss/89472/Visualization-No-Code
Time O(MN*log(MN))
Space O(MN)
*/
private static final int[][] dirs = new int[][] {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
public int trapRainWater(int[][] heightMap) {
if (heightMap == null || heightMap.length == 0) return 0;
int m = heightMap.length, n = heightMap[0].length;
boolean[][] visited = new boolean[m][n];
PriorityQueue<int[]> pq = new PriorityQueue<>((a, b) -> a[2] - b[2]);
for (int i = 0; i < m; i++) {
pq.offer(new int[] {i, 0, heightMap[i][0]});
pq.offer(new int[] {i, n - 1, heightMap[i][n - 1]});
visited[i][0] = true;
visited[i][n - 1] = true;
}
for (int j = 1; j < n; j++) {
pq.offer(new int[] {0, j, heightMap[0][j]});
pq.offer(new int[] {m - 1, j, heightMap[m - 1][j]});
visited[0][j] = true;
visited[m - 1][j] = true;
}
int res = 0;
while (!pq.isEmpty()) {
int[] cell = pq.poll();
for (int[] dir : dirs) {
int x = dir[0] + cell[0], y = dir[1] + cell[1];
if (x < 0 || x >= m || y < 0 || y >= n || visited[x][y]) continue;
res += Math.max(0, cell[2] - heightMap[x][y]);
pq.offer(new int[] {x, y, Math.max(heightMap[x][y], cell[2])});
visited[x][y] = true;
}
}
return res;
}
}