feat: add solutions to lc problem: No.1823

No.1823.Find the Winner of the Circular Game

Author: yanglbme

solution/0000-0099/0099.Recover Binary Search Tree/README.md

@@ -254,7 +254,7 @@ public class Solution {
 
 ### **JavaScript**
 
-```javascript
+```js
 /**
  * Definition for a binary tree node.
  * function TreeNode(val, left, right) {

solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md

@@ -245,7 +245,7 @@ public class Solution {
 
 ### **JavaScript**
 
-```javascript
+```js
 /**
  * Definition for a binary tree node.
  * function TreeNode(val, left, right) {

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

@@ -58,22 +58,65 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+约瑟夫环。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findTheWinner(self, n: int, k: int) -> int:
+        if n == 1:
+            return 1
+        ans = (k + self.findTheWinner(n - 1, k)) % n
+        return n if ans == 0 else ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int findTheWinner(int n, int k) {
+        if (n == 1) {
+            return 1;
+        }
+        int ans = (findTheWinner(n - 1, k) + k) % n;
+        return ans == 0 ? n : ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findTheWinner(int n, int k) {
+        if (n == 1) return 1;
+        int ans = (findTheWinner(n - 1, k) + k) % n;
+        return ans == 0 ? n : ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findTheWinner(n int, k int) int {
+	if n == 1 {
+		return 1
+	}
+	ans := (findTheWinner(n-1, k) + k) % n
+	if ans == 0 {
+		return n
+	}
+	return ans
+}
 ```
 
 ### **...**

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

@@ -77,13 +77,54 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findTheWinner(self, n: int, k: int) -> int:
+        if n == 1:
+            return 1
+        ans = (k + self.findTheWinner(n - 1, k)) % n
+        return n if ans == 0 else ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int findTheWinner(int n, int k) {
+        if (n == 1) {
+            return 1;
+        }
+        int ans = (findTheWinner(n - 1, k) + k) % n;
+        return ans == 0 ? n : ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findTheWinner(int n, int k) {
+        if (n == 1) return 1;
+        int ans = (findTheWinner(n - 1, k) + k) % n;
+        return ans == 0 ? n : ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findTheWinner(n int, k int) int {
+	if n == 1 {
+		return 1
+	}
+	ans := (findTheWinner(n-1, k) + k) % n
+	if ans == 0 {
+		return n
+	}
+	return ans
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,8 @@
+class Solution {
+public:
+    int findTheWinner(int n, int k) {
+        if (n == 1) return 1;
+        int ans = (findTheWinner(n - 1, k) + k) % n;
+        return ans == 0 ? n : ans;
+    }
+};

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

@@ -0,0 +1,10 @@
+func findTheWinner(n int, k int) int {
+	if n == 1 {
+		return 1
+	}
+	ans := (findTheWinner(n-1, k) + k) % n
+	if ans == 0 {
+		return n
+	}
+	return ans
+}

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

@@ -0,0 +1,9 @@
+class Solution {
+    public int findTheWinner(int n, int k) {
+        if (n == 1) {
+            return 1;
+        }
+        int ans = (findTheWinner(n - 1, k) + k) % n;
+        return ans == 0 ? n : ans;
+    }
+}

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

@@ -0,0 +1,6 @@
+class Solution:
+    def findTheWinner(self, n: int, k: int) -> int:
+        if n == 1:
+            return 1
+        ans = (k + self.findTheWinner(n - 1, k)) % n
+        return n if ans == 0 else ans