https://leetcode.cn/problems/design-a-food-rating-system/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/design-a-food-rating-system/
+
 https://leetcode.cn/problems/minimum-score-after-removals-on-a-tree/
 
 https://leetcode.cn/problems/first-common-ancestor-lcci/

design-a-food-rating-system/index.ts

@@ -0,0 +1,39 @@
+import { AvlTree } from "https://esm.sh/@datastructures-js/[email protected]/?dts";
+
+class FoodRatings {
+    #cuisineToTree = new Map<string, AvlTree<string>>();
+    #foodToTree = new Map<string, AvlTree<string>>();
+    #foodToRating = new Map<string, number>();
+    constructor(foods: string[], cuisines: string[], ratings: number[]) {
+        for (const [index, food] of foods.entries()) {
+            const cuisine = cuisines[index];
+            const rating = ratings[index];
+            this.#foodToRating.set(food, rating);
+            const tree = this.#cuisineToTree.get(cuisine) ??
+                new AvlTree((a, b) => {
+                    const ra = this.#foodToRating.get(a) ?? 0;
+                    const rb = this.#foodToRating.get(b) ?? 0;
+                    return ra === rb ? a.localeCompare(b) : -ra + rb;
+                });
+
+            this.#cuisineToTree.set(cuisine, tree);
+            this.#foodToTree.set(food, tree);
+
+            tree.insert(food);
+        }
+    }
+
+    changeRating(food: string, newRating: number): void {
+        const tree = this.#foodToTree.get(food);
+        if (!tree) throw Error("not found");
+
+        tree.remove(food);
+        this.#foodToRating.set(food, newRating);
+        tree.insert(food);
+    }
+
+    highestRated(cuisine: string): string {
+        return this.#cuisineToTree.get(cuisine)?.min()?.getValue() ?? "";
+    }
+}
+export default FoodRatings;

last-stone-weight/index.ts

@@ -1,7 +1,7 @@
 import { PriorityQueue } from "../kth-largest-element-in-a-stream/PriorityQueue.ts";
 
 export default function lastStoneWeight(stones: number[]): number {
-    const maxheap = PriorityQueue<number>((a, b) =>- a + b);
+    const maxheap = PriorityQueue<number>((a, b) => -a + b);
     stones.forEach((stone) => maxheap.offer(stone));
     while (maxheap.length() >= 2) {
         const y = maxheap.shift();