feat: add python and java solutions to leetcode problem: No.0293

Author: yanglbme

solution/0200-0299/0293.Flip Game/README.md

@@ -35,15 +35,38 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def generatePossibleNextMoves(self, s: str) -> List[str]:
+        if not s or len(s) < 2:
+            return []
+        n = len(s)
+        res = []
+        for i in range(n - 1):
+            if s[i] == '+' and s[i + 1] == '+':
+                res.append(s[:i] + "--" + s[i + 2:])
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public List<String> generatePossibleNextMoves(String s) {
+        int n;
+        if (s == null || (n = s.length()) < 2) return Collections.emptyList();
+        List<String> res = new ArrayList<>();
+        for (int i = 0; i < n - 1; ++i) {
+            if (s.charAt(i) == '+' && s.charAt(i + 1) == '+') {
+                StringBuilder sb = new StringBuilder(s);
+                sb.replace(i, i + 2, "--");
+                res.add(sb.toString());
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0293.Flip Game/README_EN.md

@@ -29,13 +29,36 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def generatePossibleNextMoves(self, s: str) -> List[str]:
+        if not s or len(s) < 2:
+            return []
+        n = len(s)
+        res = []
+        for i in range(n - 1):
+            if s[i] == '+' and s[i + 1] == '+':
+                res.append(s[:i] + "--" + s[i + 2:])
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public List<String> generatePossibleNextMoves(String s) {
+        int n;
+        if (s == null || (n = s.length()) < 2) return Collections.emptyList();
+        List<String> res = new ArrayList<>();
+        for (int i = 0; i < n - 1; ++i) {
+            if (s.charAt(i) == '+' && s.charAt(i + 1) == '+') {
+                StringBuilder sb = new StringBuilder(s);
+                sb.replace(i, i + 2, "--");
+                res.add(sb.toString());
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0293.Flip Game/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public List<String> generatePossibleNextMoves(String s) {
+        int n;
+        if (s == null || (n = s.length()) < 2) return Collections.emptyList();
+        List<String> res = new ArrayList<>();
+        for (int i = 0; i < n - 1; ++i) {
+            if (s.charAt(i) == '+' && s.charAt(i + 1) == '+') {
+                StringBuilder sb = new StringBuilder(s);
+                sb.replace(i, i + 2, "--");
+                res.add(sb.toString());
+            }
+        }
+        return res;
+    }
+}

solution/0200-0299/0293.Flip Game/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def generatePossibleNextMoves(self, s: str) -> List[str]:
+        if not s or len(s) < 2:
+            return []
+        n = len(s)
+        res = []
+        for i in range(n - 1):
+            if s[i] == '+' and s[i + 1] == '+':
+                res.append(s[:i] + "--" + s[i + 2:])
+        return res

solution/0300-0399/0344.Reverse String/Solution.py

@@ -1,6 +1,10 @@
 class Solution:
-    def reverseString(self, s: List[str]) -> None:
-        """
-        Do not return anything, modify s in-place instead.
-        """
-        s[:] = s[::-1]
+    def generatePossibleNextMoves(self, s: str) -> List[str]:
+        if not s or len(s) < 2:
+            return []
+        n = len(s)
+        res = []
+        for i in range(n - 1):
+            if s[i] == '+' and s[i + 1] == '+':
+                res.append(s[:i] + "--" + s[i + 2:])
+        return res