https://leetcode.cn/problems/zero-matrix-lcci/ https://leetcode.cn/problems/fancy-sequence

Author: masx200

README.md

@@ -10,6 +10,10 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/zero-matrix-lcci/
+
+https://leetcode.cn/problems/fancy-sequence
+
 https://leetcode.cn/problems/regions-cut-by-slashes/
 
 https://leetcode.cn/problems/minimum-amount-of-time-to-collect-garbage/

fancy-sequence/index.ts

@@ -0,0 +1,29 @@
+export default class Fancy {
+    #l: number[] = [];
+    #a = [0n];
+    #m = [1n];
+    constructor() {}
+
+    append(val: number): void {
+        this.#l.push(val);
+        this.#a.push(this.#a.at(-1) as bigint);
+        this.#m.push(this.#m.at(-1) as bigint);
+    }
+
+    addAll(inc: number): void {
+        this.#a[this.#a.length - 1] += BigInt(inc);
+    }
+
+    multAll(m: number): void {
+        this.#a[this.#a.length - 1] *= BigInt(m);
+        this.#m[this.#m.length - 1] *= BigInt(m);
+    }
+
+    getIndex(idx: number): number {
+        if (idx >= this.#l.length) return -1;
+        const m = (this.#m.at(-1) as bigint) / this.#m[idx];
+        const c = (this.#a.at(-1) as bigint) - this.#a[idx] * m;
+
+        return Number((BigInt(this.#l[idx]) * m + c) % BigInt(1e9 + 7));
+    }
+}