feat: add typescript solution to lc problem: No.0232.Implement Queue using Stacks

Author: zhaocchen

solution/0200-0299/0232.Implement Queue using Stacks/README.md

@@ -192,6 +192,54 @@ class MyQueue {
  */
 ```
 
+### **TypeScript**
+
+```ts
+class MyQueue {
+    stack1: number[];
+    stack2: number[];
+    constructor() {
+        this.stack1 = [];
+        this.stack2 = [];
+    }
+
+    push(x: number): void {
+        this.stack1.push(x);
+    }
+
+    pop(): number {
+        if (!this.stack2.length) {
+            while (this.stack1.length) {
+                this.stack2.push(this.stack1.pop());
+            }
+        }
+        return this.stack2.pop();
+    }
+
+    peek(): number {
+        if (!this.stack2.length) {
+            while (this.stack1.length) {
+                this.stack2.push(this.stack1.pop());
+            }
+        }
+        return this.stack2[this.stack2.length - 1];
+    }
+
+    empty(): boolean {
+        return !this.stack1.length && !this.stack2.length;
+    }
+}
+
+/**
+ * Your MyQueue object will be instantiated and called as such:
+ * var obj = new MyQueue()
+ * obj.push(x)
+ * var param_2 = obj.pop()
+ * var param_3 = obj.peek()
+ * var param_4 = obj.empty()
+ */
+```
+
 ### **...**
 
 ```

solution/0200-0299/0232.Implement Queue using Stacks/README_EN.md

@@ -171,6 +171,54 @@ class MyQueue {
  */
 ```
 
+### **TypeScript**
+
+```ts
+class MyQueue {
+    stack1: number[];
+    stack2: number[];
+    constructor() {
+        this.stack1 = [];
+        this.stack2 = [];
+    }
+
+    push(x: number): void {
+        this.stack1.push(x);
+    }
+
+    pop(): number {
+        if (!this.stack2.length) {
+            while (this.stack1.length) {
+                this.stack2.push(this.stack1.pop());
+            }
+        }
+        return this.stack2.pop();
+    }
+
+    peek(): number {
+        if (!this.stack2.length) {
+            while (this.stack1.length) {
+                this.stack2.push(this.stack1.pop());
+            }
+        }
+        return this.stack2[this.stack2.length - 1];
+    }
+
+    empty(): boolean {
+        return !this.stack1.length && !this.stack2.length;
+    }
+}
+
+/**
+ * Your MyQueue object will be instantiated and called as such:
+ * var obj = new MyQueue()
+ * obj.push(x)
+ * var param_2 = obj.pop()
+ * var param_3 = obj.peek()
+ * var param_4 = obj.empty()
+ */
+```
+
 ### **...**
 
 ```

solution/0200-0299/0232.Implement Queue using Stacks/Solution.ts

@@ -0,0 +1,43 @@
+class MyQueue {
+    stack1: number[];
+    stack2: number[];
+    constructor() {
+        this.stack1 = [];
+        this.stack2 = [];
+    }
+
+    push(x: number): void {
+        this.stack1.push(x);
+    }
+
+    pop(): number {
+        if (!this.stack2.length) {
+            while (this.stack1.length) {
+                this.stack2.push(this.stack1.pop());
+            }
+        }
+        return this.stack2.pop();
+    }
+
+    peek(): number {
+        if (!this.stack2.length) {
+            while (this.stack1.length) {
+                this.stack2.push(this.stack1.pop());
+            }
+        }
+        return this.stack2[this.stack2.length - 1];
+    }
+
+    empty(): boolean {
+        return !this.stack1.length && !this.stack2.length;
+    }
+}
+
+/**
+ * Your MyQueue object will be instantiated and called as such:
+ * var obj = new MyQueue()
+ * obj.push(x)
+ * var param_2 = obj.pop()
+ * var param_3 = obj.peek()
+ * var param_4 = obj.empty()
+ */