https://leetcode.cn/problems/design-a-stack-with-increment-operation/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/design-a-stack-with-increment-operation/
+
 https://leetcode.cn/problems/ugly-number/
 
 https://leetcode.cn/problems/get-kth-magic-number-lcci/

design-a-stack-with-increment-operation/index.ts

@@ -0,0 +1,31 @@
+export default class CustomStack {
+    #stack = Array<[number, number]>();
+    constructor(public capacity: number) {}
+
+    push(x: number): void {
+        if (this.#stack.length >= this.capacity) {
+            return;
+        }
+        this.#stack.push([x, 0]);
+    }
+
+    pop(): number {
+        if (this.#stack.length === 0) return -1;
+        const last = this.#stack[this.#stack.length - 1];
+        this.#stack.pop();
+        if (this.#stack.length) {
+            this.increment(this.#stack.length, last[1]);
+        }
+        return last[0] + last[1];
+    }
+
+    increment(k: number, val: number): void {
+        if (this.#stack.length === 0) return;
+        // console.log(this,k,val)
+        if (this.#stack.length < k) {
+            k = this.#stack.length;
+        }
+        //   console.log(this,k,val)
+        this.#stack[k - 1][1] += val;
+    }
+}

design-circular-deque/index.ts

@@ -8,15 +8,15 @@ export default interface MyCircularDeque<T = any> {
     deleteLast: () => boolean;
     getRear: () => T | number;
     isFull: () => boolean;
-    capcity: number;
+    capacity: number;
 }
 
 // deno-lint-ignore no-explicit-any
 export default function MyCircularDeque<T = any>(
-    capcity = Infinity,
+    capacity = Infinity,
 ): MyCircularDeque<T> {
     // console.log('MyCircularDeque', k)
-    if (capcity < 1) throw Error("k greater than or equal  one");
+    if (capacity < 1) throw Error("k greater than or equal  one");
     const storage = new Map<bigint, T>();
     let min = BigInt(0);
     let max = BigInt(0);
@@ -113,7 +113,7 @@ export default function MyCircularDeque<T = any>(
         return r as T;
     }
     function isFull(): boolean {
-        return storage.size >= capcity;
+        return storage.size >= capacity;
     }
     return {
         isEmpty,
@@ -124,6 +124,6 @@ export default function MyCircularDeque<T = any>(
         deleteLast,
         getRear,
         isFull,
-        capcity: capcity,
+        capacity: capacity,
     };
 }

design-circular-queue/index.ts

@@ -7,15 +7,15 @@ type MyCircularQueue<T = any> = {
     enQueue: (value: T) => boolean;
     Rear: () => T | number;
     isFull: () => boolean;
-    capcity: number;
+    capacity: number;
 };
 // deno-lint-ignore no-explicit-any
 function MyCircularQueue<T = any>(
     // deno-lint-ignore no-inferrable-types
-    capcity: number = Infinity,
+    capacity: number = Infinity,
 ): MyCircularQueue<T> {
     // console.log('MyCircularDeque', k)
-    if (capcity < 1) {
+    if (capacity < 1) {
         throw Error("k greater than or equal  one");
     }
     const storage = new Map<bigint, T>();
@@ -123,7 +123,15 @@ function MyCircularQueue<T = any>(
         return r as T;
     }
     function isFull(): boolean {
-        return storage.size >= capcity;
+        return storage.size >= capacity;
     }
-    return { isEmpty, Front, deQueue, enQueue, Rear, isFull, capcity: capcity };
+    return {
+        isEmpty,
+        Front,
+        deQueue,
+        enQueue,
+        Rear,
+        isFull,
+        capacity: capacity,
+    };
 }

ugly-number/index.ts

@@ -1,13 +1,13 @@
-function isUgly(n: number): boolean {
-    if (n <= 0) {
-        return false;
-    }
-
-    for (const factor of [2, 3, 5]) {
-        while (n % factor === 0) {
-            n /= factor;
-        }
-    }
-    return n == 1;
-}
-export default isUgly;
+function isUgly(n: number): boolean {
+    if (n <= 0) {
+        return false;
+    }
+
+    for (const factor of [2, 3, 5]) {
+        while (n % factor === 0) {
+            n /= factor;
+        }
+    }
+    return n == 1;
+}
+export default isUgly;