Update 407-trapping-rain-water-ii.js

Author: everthis

407-trapping-rain-water-ii.js

@@ -1,3 +1,113 @@
+/**
+ * @param {number[][]} heightMap
+ * @return {number}
+ */
+
+const trapRainWater = function (heightMap) {
+  const pq = new PriorityQueue((a, b) => a[2] < b[2])
+  const m = heightMap.length, n = heightMap[0].length
+  
+  const visited = Array.from({ length: m }, () => Array(n).fill(false))
+  
+  for(let i = 0; i < m; i++) {
+    visited[i][0] = visited[i][n - 1] = true
+    pq.push([i, 0, heightMap[i][0]])
+    pq.push([i, n - 1, heightMap[i][n - 1]])
+  }
+  for(let j = 1; j < n - 1; j++) {
+    visited[0][j] = visited[m - 1][j] = true
+    pq.push([0, j, heightMap[0][j]], [m - 1, j, heightMap[m - 1][j]])
+  }
+  
+  let res = 0
+  const dirs = [[-1, 0], [1, 0], [0, 1], [0, -1]]
+  while(!pq.isEmpty()) {
+    const cur = pq.pop()
+    const [r, c, h] = cur
+    for(let dir of dirs) {
+      const newR = r + dir[0], newC = c + dir[1]
+      if(newR < 0 || newR >= m || newC < 0 || newC >= n || visited[newR][newC]) continue
+      visited[newR][newC] = true
+      res += Math.max(0, h - heightMap[newR][newC])
+      pq.push([newR, newC, Math.max(h, heightMap[newR][newC])])
+    }
+  }
+  
+  return res
+
+}
+class PriorityQueue {
+  constructor(comparator = (a, b) => a > b) {
+    this.heap = []
+    this.top = 0
+    this.comparator = comparator
+  }
+  size() {
+    return this.heap.length
+  }
+  isEmpty() {
+    return this.size() === 0
+  }
+  peek() {
+    return this.heap[this.top]
+  }
+  push(...values) {
+    values.forEach((value) => {
+      this.heap.push(value)
+      this.siftUp()
+    })
+    return this.size()
+  }
+  pop() {
+    const poppedValue = this.peek()
+    const bottom = this.size() - 1
+    if (bottom > this.top) {
+      this.swap(this.top, bottom)
+    }
+    this.heap.pop()
+    this.siftDown()
+    return poppedValue
+  }
+  replace(value) {
+    const replacedValue = this.peek()
+    this.heap[this.top] = value
+    this.siftDown()
+    return replacedValue
+  }
+
+  parent = (i) => ((i + 1) >>> 1) - 1
+  left = (i) => (i << 1) + 1
+  right = (i) => (i + 1) << 1
+  greater = (i, j) => this.comparator(this.heap[i], this.heap[j])
+  swap = (i, j) => ([this.heap[i], this.heap[j]] = [this.heap[j], this.heap[i]])
+  siftUp = () => {
+    let node = this.size() - 1
+    while (node > this.top && this.greater(node, this.parent(node))) {
+      this.swap(node, this.parent(node))
+      node = this.parent(node)
+    }
+  }
+  siftDown = () => {
+    let node = this.top
+    while (
+      (this.left(node) < this.size() && this.greater(this.left(node), node)) ||
+      (this.right(node) < this.size() && this.greater(this.right(node), node))
+    ) {
+      let maxChild =
+        this.right(node) < this.size() &&
+        this.greater(this.right(node), this.left(node))
+          ? this.right(node)
+          : this.left(node)
+      this.swap(node, maxChild)
+      node = maxChild
+    }
+  }
+}
+
+
+
+// another
+
 /**
  * @param {number[][]} heightMap
  * @return {number}