升级 bst

Author: masx200

tweet-counts-per-frequency/index.ts

@@ -2,18 +2,23 @@ import { BinarySearchTree } from "../deps.ts";
 import { traversal_bst_range } from "./traversal_bst_range.ts";
 
 export default class TweetCounts {
-    #name_to_bst = new Map<string, BinarySearchTree<number, number>>();
-    constructor() {}
+    #name_to_bst = new Map<string, BinarySearchTree<number>>();
+    #key_to_count = new Map<number, number>();
 
     recordTweet(tweetName: string, time: number): void {
         const bst = this.#name_to_bst.get(tweetName) ??
-            new BinarySearchTree<number, number>();
+            new BinarySearchTree<number>();
         const node = bst.find(time);
         if (node) {
-            node.setValue(node.getValue() + 1);
+            this.#key_to_count.set(
+                time,
+                (this.#key_to_count.get(time) ?? 0) + 1,
+            );
+
             return;
         }
-        bst.insert(time, 1);
+        bst.insert(time);
+        this.#key_to_count.set(time, (this.#key_to_count.get(time) ?? 0) + 1);
         this.#name_to_bst.set(tweetName, bst);
     }
 
@@ -38,14 +43,12 @@ export default class TweetCounts {
         const result: number[] = Array(
             Math.ceil((endTime - startTime + 1) / length),
         ).fill(0);
-        traversal_bst_range(
-            bst.root(),
-            startTime,
-            endTime,
-            (num: number, value: number) => {
-                result[Math.floor((num - startTime + 1) / length)] += value;
-            },
-        );
+        traversal_bst_range(bst.root(), startTime, endTime, (num: number) => {
+            const time = num;
+            const value = (this.#key_to_count.get(time) ?? 0);
+
+            result[Math.floor((num - startTime + 1) / length)] += value;
+        });
         return result;
     }
 }

tweet-counts-per-frequency/traversal_bst_range.ts

@@ -1,19 +1,16 @@
 import { BinarySearchTreeNode } from "../deps.ts";
 
-export function traversal_bst_range<
-    K extends string | number = number,
-    V = number,
->(
-    node: BinarySearchTreeNode<K, V> | null | undefined,
+export function traversal_bst_range<K extends string | number = number>(
+    node: BinarySearchTreeNode<K> | null | undefined,
     low: number,
     high: number,
-    callback: (key: K, value: V) => void,
+    callback: (key: K) => void,
 ) {
     if (!node) return;
 
-    const value = node.getKey();
+    const value = node.getValue();
     if (value <= high && value >= low) {
-        callback(value, node.getValue());
+        callback(value);
     }
     if (value > low) {
         traversal_bst_range(node.getLeft(), low, high, callback);