feat: add typescript solution to lcof2 problem: No.042

剑指 Offer II 042. 最近请求次数

Author: zhaocchen

lcof2/剑指 Offer II 042. 最近请求次数/Solution.ts

@@ -0,0 +1,18 @@
+class RecentCounter {
+    stack: Array<number>;
+    cnt: number;
+    constructor() {
+        this.stack = [];
+        this.cnt = 0;
+    }
+
+    ping(t: number): number {
+        while (this.stack.length && this.stack[0] + 3000 < t) {
+            this.cnt--;
+            this.stack.shift()
+        }
+        this.cnt++;
+        this.stack.push(t);
+        return this.cnt;
+    }
+}