2335. 装满杯子需要的最短总时长

Author: w2xi

README.md

@@ -223,6 +223,7 @@
 |2319|[判断矩阵是否是一个 X 矩阵](https://leetcode.cn/problems/check-if-matrix-is-x-matrix/)|[JavaScript](./algorithms/check-if-matrix-is-x-matrix.js)|Easy|
 |2325|[解密消息](https://leetcode.cn/problems/decode-the-message/)|[JavaScript](./algorithms/decode-the-message.js)|Easy|
 |2331|[计算布尔二叉树的值](https://leetcode.cn/problems/evaluate-boolean-binary-tree/)|[JavaScript](./algorithms/evaluate-boolean-binary-tree.js)|Easy|
+|2335|[装满杯子需要的最短总时长](https://leetcode.cn/problems/minimum-amount-of-time-to-fill-cups/)|[JavaScript](./algorithms/minimum-amount-of-time-to-fill-cups.js)|Easy|
 |2351|[第一个出现两次的字母](https://leetcode.cn/problems/first-letter-to-appear-twice/)|[JavaScript](./algorithms/first-letter-to-appear-twice.js)|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|

algorithms/minimum-amount-of-time-to-fill-cups.js

@@ -0,0 +1,101 @@
+/**
+ * 2335. 装满杯子需要的最短总时长
+ * @param {number[]} amount
+ * @return {number}
+ */
+var fillCups = function (amount) {
+  let count = 0;
+  // 大顶堆
+  const maxHeap = new MaxHeap();
+
+  for (let i = 0; i < amount.length; i++) {
+    maxHeap.push(amount[i]);
+  }
+  while (true) {
+    const first = maxHeap.pop();
+    const second = maxHeap.pop();
+
+    if (second === 0) {
+      count += first;
+      break;
+    }
+    count++;
+    maxHeap.push(first - 1);
+    maxHeap.push(second - 1);
+  }
+
+  return count;
+};
+
+/**
+ * 优先队列 - 堆
+ * 对外暴露接口:
+ *  - push: 向队尾添加元素
+ *  - pop:  从队头取出元素
+ */
+class MaxHeap {
+  constructor() {
+    this.queue = [];
+  }
+
+  push(item) {
+    this.queue.push(item);
+    // 上移
+    this.siftUp(this.size() - 1);
+  }
+
+  pop() {
+    if (this.size() === 0) {
+      return;
+    }
+    if (this.size() === 1) {
+      return this.queue.pop();
+    }
+    const removedItem = this.queue[0];
+    this.queue[0] = this.queue.pop();
+    // 下沉
+    this.siftDown(0);
+
+    return removedItem;
+  }
+
+  // 上移
+  siftUp(index) {
+    const parent = index === 0 ? null : (index - 1) >> 1;
+
+    if (index > 0 && this.queue[index] > this.queue[parent]) {
+      swap(this.queue, index, parent);
+      this.siftUp(parent);
+    }
+  }
+
+  // 下沉
+  siftDown(index) {
+    const left = index * 2 + 1;
+    const right = index * 2 + 2;
+    const size = this.size();
+    let last = index;
+
+    if (left < size && this.queue[left] > this.queue[last]) {
+      last = left;
+    }
+    if (right < size && this.queue[right] > this.queue[last]) {
+      last = right;
+    }
+
+    if (last !== index) {
+      swap(this.queue, index, last);
+      this.siftDown(last);
+    }
+  }
+
+  size() {
+    return this.queue.length;
+  }
+}
+
+function swap(arr, i, j) {
+  const temp = arr[i];
+  arr[i] = arr[j];
+  arr[j] = temp;
+}