feat: add python and java solutions to lcci problem: 01.09.String Rotation

添加《程序员面试金典》题解：01.09.字符串轮转

Author: yanglbme

lcci/01.09.String Rotation/README.md

@@ -39,32 +39,21 @@
 
 <!-- tabs:start -->
 
+### **Python3**
+
+```python
+class Solution:
+    def isFlipedString(self, s1: str, s2: str) -> bool:
+        return len(s1) == len(s2) and s1 in (s2 * 2)
+```
+
 ### **Java**
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
 class Solution {
     public boolean isFlipedString(String s1, String s2) {
-        int len1 = s1.length(), len2 = s2.length();
-        if (len1 != len2) {
-            return false;
-        }
-        if ((len1 == 0 && len2 == 0) || (s1.equals(s2))) {
-            return true;
-        }
-
-        for (int i = 0; i < len1; ++i) {
-            s1 = flip(s1);
-            if (s1.equals(s2)) {
-                return true;
-            }
-        }
-        return false;
-
-    }
-
-    private String flip(String s) {
-        return s.substring(1) + s.charAt(0);
+        return s1.length() == s2.length() && (s2 + s2).indexOf(s1) != -1;
     }
 }
 ```

lcci/01.09.String Rotation/README_EN.md

@@ -52,31 +52,22 @@
 
 ## Solutions
 
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+class Solution:
+    def isFlipedString(self, s1: str, s2: str) -> bool:
+        return len(s1) == len(s2) and s1 in (s2 * 2)
+```
+
 ### **Java**
 
 ```java
 class Solution {
     public boolean isFlipedString(String s1, String s2) {
-        int len1 = s1.length(), len2 = s2.length();
-        if (len1 != len2) {
-            return false;
-        }
-        if ((len1 == 0 && len2 == 0) || (s1.equals(s2))) {
-            return true;
-        }
-
-        for (int i = 0; i < len1; ++i) {
-            s1 = flip(s1);
-            if (s1.equals(s2)) {
-                return true;
-            }
-        }
-        return false;
-
-    }
-
-    private String flip(String s) {
-        return s.substring(1) + s.charAt(0);
+        return s1.length() == s2.length() && (s2 + s2).indexOf(s1) != -1;
     }
 }
 ```

lcci/01.09.String Rotation/Solution.java

@@ -1,24 +1,5 @@
 class Solution {
     public boolean isFlipedString(String s1, String s2) {
-        int len1 = s1.length(), len2 = s2.length();
-        if (len1 != len2) {
-            return false;
-        }
-        if ((len1 == 0 && len2 == 0) || (s1.equals(s2))) {
-            return true;
-        }
-
-        for (int i = 0; i < len1; ++i) {
-            s1 = flip(s1);
-            if (s1.equals(s2)) {
-                return true;
-            }
-        }
-        return false;
-
-    }
-
-    private String flip(String s) {
-        return s.substring(1) + s.charAt(0);
+        return s1.length() == s2.length() && (s2 + s2).indexOf(s1) != -1;
     }
 }

lcci/01.09.String Rotation/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def isFlipedString(self, s1: str, s2: str) -> bool:
+        return len(s1) == len(s2) and s1 in (s2 * 2)