https://leetcode.cn/problems/find-servers-that-handled-most-number-of-requests/

Author: masx200

README.md

@@ -10,6 +10,10 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/number-of-closed-islands/
+
+https://leetcode.cn/problems/find-servers-that-handled-most-number-of-requests/
+
 https://leetcode.cn/problems/binary-tree-paths/
 
 https://leetcode-cn.com/problems/trim-a-binary-search-tree/

deps.ts

@@ -19,6 +19,7 @@ export { combinations } from "https://deno.land/x/[email protected]/mod.ts";
 export { isIP } from "https://deno.land/[email protected]/node/internal/net.ts";
 export { Heap } from "https://esm.sh/@datastructures-js/[email protected]/?dts";
 export {
+    AvlTree,
     BinarySearchTree,
     BinarySearchTreeNode,
 } from "https://esm.sh/@datastructures-js/[email protected]/?dts";

find-servers-that-handled-most-number-of-requests/index.ts

@@ -0,0 +1,37 @@
+export default busiestServers;
+import { AvlTree, Heap } from "../deps.ts";
+function busiestServers(
+    k: number,
+    arrival: number[],
+    load: number[],
+): number[] {
+    const cnts = new Map<number, number>();
+    const pq = new Heap<[number, number]>((a, b) => a[0] - b[0]);
+    const free = new AvlTree<number>((a, b) => a - b);
+    for (const i of Array(k).keys()) {
+        free.insert(i);
+    }
+    let max = 0;
+    for (const [i, a] of arrival.entries()) {
+        const l = load[i];
+        while (!pq.isEmpty() && pq.root()[0] <= a) {
+            free.insert(pq.pop()[1]);
+        }
+        if (free.count() === 0) continue;
+        const hope = i % k;
+
+        const next = free.ceil(hope)?.getValue() ??
+            free.min()?.getValue() ??
+            0;
+
+        const value = (cnts.get(next) ?? 0) + 1;
+        cnts.set(next, value);
+        max = Math.max(value, max);
+
+        free.remove(next);
+        pq.insert([a + l, next]);
+    }
+    return Array.from(cnts.entries())
+        .filter((a) => a[1] === max)
+        .map((a) => a[0]);
+}

number-of-closed-islands/index.ts

@@ -0,0 +1,2 @@
+function closedIsland(grid: number[][]): number {}
+export default closedIsland;