feat: add solutions to lcci problem: No.01.09

No.01.09.String Rotation

Author: YangFong

lcci/01.09.String Rotation/README.md

@@ -68,6 +68,55 @@ func isFlipedString(s1 string, s2 string) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function isFlipedString(s1: string, s2: string): boolean {
+    return s1.length === s2.length && (s2 + s2).indexOf(s1) !== -1;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn is_fliped_string(s1: String, s2: String) -> bool {
+        s1.len() == s2.len() && (s2.clone() + &s2).contains(&s1)   
+    }
+}
+```
+
+原始写法：
+
+```rust
+impl Solution {
+    pub fn is_fliped_string(s1: String, s2: String) -> bool {
+        if s1 == s2 {
+            return true;
+        }
+        if s1.len() != s2.len() {
+            return false;
+        }
+        let s2: Vec<char> = (s2.clone() + &s2).chars().collect();
+        let n = s1.len();
+        let m = s2.len();
+        for i in 0..m - n {
+            let mut is_pass = true;
+            for (j, c) in s1.chars().enumerate() {
+                if c != s2[i + j] {
+                    is_pass = false;
+                    break;
+                }
+            }
+            if is_pass {
+                return true;
+            };
+        }
+        false
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/01.09.String Rotation/README_EN.md

@@ -64,6 +64,53 @@ func isFlipedString(s1 string, s2 string) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function isFlipedString(s1: string, s2: string): boolean {
+    return s1.length === s2.length && (s2 + s2).indexOf(s1) !== -1;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn is_fliped_string(s1: String, s2: String) -> bool {
+        s1.len() == s2.len() && (s2.clone() + &s2).contains(&s1)   
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn is_fliped_string(s1: String, s2: String) -> bool {
+        if s1 == s2 {
+            return true;
+        }
+        if s1.len() != s2.len() {
+            return false;
+        }
+        let s2: Vec<char> = (s2.clone() + &s2).chars().collect();
+        let n = s1.len();
+        let m = s2.len();
+        for i in 0..m - n {
+            let mut is_pass = true;
+            for (j, c) in s1.chars().enumerate() {
+                if c != s2[i + j] {
+                    is_pass = false;
+                    break;
+                }
+            }
+            if is_pass {
+                return true;
+            };
+        }
+        false
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/01.09.String Rotation/Solution.rs

@@ -0,0 +1,5 @@
+impl Solution {
+    pub fn is_fliped_string(s1: String, s2: String) -> bool {
+        s1.len() == s2.len() && (s2.clone() + &s2).contains(&s1)
+    }
+}

lcci/01.09.String Rotation/Solution.ts

@@ -0,0 +1,3 @@
+function isFlipedString(s1: string, s2: string): boolean {
+    return s1.length === s2.length && (s2 + s2).indexOf(s1) !== -1;
+}