https://leetcode.cn/problems/minimum-amount-of-time-to-collect-garbage/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/minimum-amount-of-time-to-collect-garbage/
+
 https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/
 
 https://leetcode.cn/problems/validate-binary-tree-nodes/

minimum-amount-of-time-to-collect-garbage/index.ts

@@ -0,0 +1,38 @@
+import { groupBy } from "../deps.ts";
+
+export default function garbageCollection(
+    garbage: string[],
+    travel: number[],
+): number {
+    const pre: number[] = Array(travel.length + 1).fill(0);
+    let mc = 0;
+    let pc = 0;
+    let gc = 0;
+    let me = 0;
+    let pe = 0;
+    let ge = 0;
+    for (const [i, s] of garbage.entries()) {
+        if (i !== 0) {
+            pre[i] = pre[i - 1] + travel[i - 1];
+        }
+
+        const counts = groupBy(s);
+        const nm = counts["M"]?.length ?? 0;
+        mc += nm;
+        const np = counts["P"]?.length ?? 0;
+        pc += np;
+        const ng = counts["G"]?.length ?? 0;
+        gc += ng;
+
+        if (nm) {
+            me = i;
+        }
+        if (np) {
+            pe = i;
+        }
+        if (ng) {
+            ge = i;
+        }
+    }
+    return mc + pc + gc + pre[me] + pre[pe] + pre[ge];
+}