Create 2610-convert-an-array-into-a-2d-array-with-conditions.js

Author: everthis

2610-convert-an-array-into-a-2d-array-with-conditions.js

@@ -0,0 +1,114 @@
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+const findMatrix = function(nums) {
+  const p1 = new PQ((a, b) => a.cnt > b.cnt)
+  const p2 = new PQ((a, b) => a.cnt > b.cnt)
+  
+  const hash = new Map()
+  for(const e of nums) {
+    if(!hash.has(e)) hash.set(e, 0)
+    hash.set(e, hash.get(e) + 1)
+  }
+  
+  for(const [k, v] of hash) {
+    p1.push({val: k, cnt: v})
+  }
+  
+  
+  const res = []
+  while(p1.size() || p2.size()) {
+    const tmp = []
+    
+    if(p1.size()) {
+      while(p1.size()) {
+        const e = p1.pop()
+        let {val, cnt} = e
+        tmp.push(val)
+        if(--cnt > 0) p2.push({val, cnt})        
+      }
+
+    } else {
+      while(p2.size()) {
+        const e = p2.pop()
+        let {val, cnt} = e
+        tmp.push(val)
+        if(--cnt > 0) p1.push({val, cnt})        
+      }
+
+    }
+    
+    res.push(tmp)
+  }
+  
+  return res
+};
+
+class PQ {
+  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
+    }
+  }
+}