https://leetcode.cn/problems/rle-iterator

Author: masx200

README.md

@@ -650,6 +650,8 @@ https://leetcode.cn/problems/generate-random-point-in-a-circle/
 
 https://leetcode.cn/problems/design-an-atm-machine/
 
+https://leetcode.cn/problems/rle-iterator
+
 #### 安装教程
 
 1. 安装`deno`

design-an-atm-machine/index.ts

@@ -1,54 +1,54 @@
-export default function ATM() {
-    const moneyStore = new Map([
-        [20, 0],
-        [50, 0],
-        [100, 0],
-        [200, 0],
-        [500, 0],
-    ]);
-    const indexToMoney = [20, 50, 100, 200, 500];
-    return {
-        deposit(banknotesCount: number[]): void {
-            for (const [index, count] of banknotesCount.entries()) {
-                const key = indexToMoney[index];
-                if (!moneyStore.has(key)) {
-                    throw new Error("moneyStore Not Found");
-                }
-                moneyStore.set(key, (moneyStore.get(key) ?? 0) + count);
-            }
-        },
-
-        withdraw(amount: number): number[] {
-            const delta = Object.fromEntries([
-                [20, 0],
-                [50, 0],
-                [100, 0],
-                [200, 0],
-                [500, 0],
-            ]);
-            const changedStore = new Map(moneyStore);
-            for (const money of [500, 200, 100, 50, 20]) {
-                if ((changedStore.get(money) ?? 0) > 0 && amount >= money) {
-                    const d = Math.min(
-                        Math.floor(amount / money),
-                        changedStore.get(money) ?? 0
-                    );
-                    amount -= money * d;
-                    delta[money] += d;
-                    changedStore.set(
-                        money,
-                        -d + (changedStore.get(money) ?? 0)
-                    );
-                }
-            }
-            if (amount > 0) {
-                return [-1];
-            } else {
-                changedStore.forEach((value, key) =>
-                    moneyStore.set(key, value)
-                );
-                return Object.values(delta);
-            }
-        },
-    };
-}
+export default function ATM() {
+    const moneyStore = new Map([
+        [20, 0],
+        [50, 0],
+        [100, 0],
+        [200, 0],
+        [500, 0],
+    ]);
+    const indexToMoney = [20, 50, 100, 200, 500];
+    return {
+        deposit(banknotesCount: number[]): void {
+            for (const [index, count] of banknotesCount.entries()) {
+                const key = indexToMoney[index];
+                if (!moneyStore.has(key)) {
+                    throw new Error("moneyStore Not Found");
+                }
+                moneyStore.set(key, (moneyStore.get(key) ?? 0) + count);
+            }
+        },
+
+        withdraw(amount: number): number[] {
+            const delta = Object.fromEntries([
+                [20, 0],
+                [50, 0],
+                [100, 0],
+                [200, 0],
+                [500, 0],
+            ]);
+            const changedStore = new Map(moneyStore);
+            for (const money of [500, 200, 100, 50, 20]) {
+                if ((changedStore.get(money) ?? 0) > 0 && amount >= money) {
+                    const d = Math.min(
+                        Math.floor(amount / money),
+                        changedStore.get(money) ?? 0,
+                    );
+                    amount -= money * d;
+                    delta[money] += d;
+                    changedStore.set(
+                        money,
+                        -d + (changedStore.get(money) ?? 0),
+                    );
+                }
+            }
+            if (amount > 0) {
+                return [-1];
+            } else {
+                changedStore.forEach((value, key) =>
+                    moneyStore.set(key, value)
+                );
+                return Object.values(delta);
+            }
+        },
+    };
+}

rle-iterator/index.ts

@@ -0,0 +1,31 @@
+export default function RLEIterator(encoding: number[]) {
+    const generator = (function* () {
+        for (let i = 0; i < encoding.length; i += 2) {
+            yield { count: encoding[i], value: encoding[i + 1] };
+        }
+    })();
+
+    let count = 0;
+    let value = 0;
+    let done = false;
+    return {
+        next(n: number): number {
+            if (done) return -1;
+            while (n > 0 && !done) {
+                if (count) {
+                    const delta = Math.min(count, n);
+                    n -= delta;
+                    count -= delta;
+                    if (n === 0) return value;
+                } else {
+                    const result = generator.next();
+                    done = !!result.done;
+                    if (result.done) return -1;
+                    value = result.value.value;
+                    count = result.value.count;
+                }
+            }
+            return -1;
+        },
+    };
+}