feat: add ts solution to lc problem: No.1823

Author: rain84

solution/1800-1899/1823.Find the Winner of the Circular Game/README.md

@@ -161,4 +161,30 @@ function findTheWinner(n, k) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2. Simulation
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findTheWinner(n: number, k: number): number {
+    const arr = Array.from({ length: n }, (_, i) => i + 1);
+    let i = 0;
+
+    while (arr.length > 1) {
+        i = (i + k - 1) % arr.length;
+        arr.splice(i, 1);
+    }
+
+    return arr[0];
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1800-1899/1823.Find the Winner of the Circular Game/README_EN.md

@@ -160,4 +160,30 @@ function findTheWinner(n, k) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2. Simulation
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findTheWinner(n: number, k: number): number {
+    const arr = Array.from({ length: n }, (_, i) => i + 1);
+    let i = 0;
+
+    while (arr.length > 1) {
+        i = (i + k - 1) % arr.length;
+        arr.splice(i, 1);
+    }
+
+    return arr[0];
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1800-1899/1823.Find the Winner of the Circular Game/Solution2.ts

@@ -0,0 +1,11 @@
+function findTheWinner(n: number, k: number): number {
+    const arr = Array.from({ length: n }, (_, i) => i + 1);
+    let i = 0;
+
+    while (arr.length > 1) {
+        i = (i + k - 1) % arr.length;
+        arr.splice(i, 1);
+    }
+
+    return arr[0];
+}