feat: add solutions to lc problems: No.1392

No.1392.Longest Happy Prefix

Author: YangFong

solution/1300-1399/1392.Longest Happy Prefix/README.md

@@ -156,6 +156,36 @@ func longestPrefix(s string) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function longestPrefix(s: string): string {
+    const n = s.length;
+    for (let i = n - 1; i >= 0; i--) {
+        if (s.slice(0, i) === s.slice(n - i, n)) {
+            return s.slice(0, i);
+        }
+    }
+    return '';
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn longest_prefix(s: String) -> String {
+        let n = s.len();
+        for i in (0..n).rev() {
+            if s[0..i] == s[n - i..n] {
+                return s[0..i].to_string();
+            }
+        }
+        String::new()
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1392.Longest Happy Prefix/README_EN.md

@@ -132,6 +132,36 @@ func longestPrefix(s string) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function longestPrefix(s: string): string {
+    const n = s.length;
+    for (let i = n - 1; i >= 0; i--) {
+        if (s.slice(0, i) === s.slice(n - i, n)) {
+            return s.slice(0, i);
+        }
+    }
+    return '';
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn longest_prefix(s: String) -> String {
+        let n = s.len();
+        for i in (0..n).rev() {
+            if s[0..i] == s[n - i..n] {
+                return s[0..i].to_string();
+            }
+        }
+        String::new()
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1300-1399/1392.Longest Happy Prefix/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn longest_prefix(s: String) -> String {
+        let n = s.len();
+        for i in (0..n).rev() {
+            if s[0..i] == s[n - i..n] {
+                return s[0..i].to_string();
+            }
+        }
+        String::new()
+    }
+}

solution/1300-1399/1392.Longest Happy Prefix/Solution.ts

@@ -0,0 +1,9 @@
+function longestPrefix(s: string): string {
+    const n = s.length;
+    for (let i = n - 1; i >= 0; i--) {
+        if (s.slice(0, i) === s.slice(n - i, n)) {
+            return s.slice(0, i);
+        }
+    }
+    return '';
+}