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

Author: rain84

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

@@ -140,40 +140,10 @@ func findTheWinner(n int, k int) int {
 #### TypeScript
 
 ```ts
-class LinkNode {
-    public val: number;
-    public next: LinkNode;
-
-    constructor(val: number = 0, next?: LinkNode) {
-        this.val = val;
-        this.next = next;
-    }
-}
-
 function findTheWinner(n: number, k: number): number {
-    if (k === 1) {
-        return n;
-    }
-    const dummy = new LinkNode(0);
-    let cur = dummy;
-    for (let i = 1; i <= n; i++) {
-        cur.next = new LinkNode(i);
-        cur = cur.next;
-    }
-    cur.next = dummy.next;
-
-    cur = dummy;
-    let count = 0;
-    while (cur.next != cur) {
-        count++;
-        if (count === k) {
-            cur.next = cur.next.next;
-            count = 0;
-        } else {
-            cur = cur.next;
-        }
-    }
-    return cur.val;
+    if (n === 1) return 1;
+    const res = (findTheWinner(n - 1, k) + k) % n;
+    return res ? res : n;
 }
 ```
 

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

@@ -139,40 +139,10 @@ func findTheWinner(n int, k int) int {
 #### TypeScript
 
 ```ts
-class LinkNode {
-    public val: number;
-    public next: LinkNode;
-
-    constructor(val: number = 0, next?: LinkNode) {
-        this.val = val;
-        this.next = next;
-    }
-}
-
 function findTheWinner(n: number, k: number): number {
-    if (k === 1) {
-        return n;
-    }
-    const dummy = new LinkNode(0);
-    let cur = dummy;
-    for (let i = 1; i <= n; i++) {
-        cur.next = new LinkNode(i);
-        cur = cur.next;
-    }
-    cur.next = dummy.next;
-
-    cur = dummy;
-    let count = 0;
-    while (cur.next != cur) {
-        count++;
-        if (count === k) {
-            cur.next = cur.next.next;
-            count = 0;
-        } else {
-            cur = cur.next;
-        }
-    }
-    return cur.val;
+    if (n === 1) return 1;
+    const res = (findTheWinner(n - 1, k) + k) % n;
+    return res ? res : n;
 }
 ```
 

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

@@ -1,35 +1,5 @@
-class LinkNode {
-    public val: number;
-    public next: LinkNode;
-
-    constructor(val: number = 0, next?: LinkNode) {
-        this.val = val;
-        this.next = next;
-    }
-}
-
 function findTheWinner(n: number, k: number): number {
-    if (k === 1) {
-        return n;
-    }
-    const dummy = new LinkNode(0);
-    let cur = dummy;
-    for (let i = 1; i <= n; i++) {
-        cur.next = new LinkNode(i);
-        cur = cur.next;
-    }
-    cur.next = dummy.next;
-
-    cur = dummy;
-    let count = 0;
-    while (cur.next != cur) {
-        count++;
-        if (count === k) {
-            cur.next = cur.next.next;
-            count = 0;
-        } else {
-            cur = cur.next;
-        }
-    }
-    return cur.val;
+    if (n === 1) return 1;
+    const res = (findTheWinner(n - 1, k) + k) % n;
+    return res ? res : n;
 }