feat: add solutions to lc problem: No.2108

No.2108.Find First Palindromic String in the Array

Author: YangFong

solution/2100-2199/2108.Find First Palindromic String in the Array/README.md

@@ -141,10 +141,71 @@ func firstPalindrome(words []string) string {
 
 ### **TypeScript**
 
-<!-- 这里可写当前语言的特殊实现逻辑 -->
-
 ```ts
+function firstPalindrome(words: string[]): string {
+    for (const word of words) {
+        let left = 0;
+        let right = word.length - 1;
+        while (left < right) {
+            if (word[left] !== word[right]) {
+                break;
+            }
+            left++;
+            right--;
+        }
+        if (left >= right) {
+            return word;
+        }
+    }
+    return '';
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn first_palindrome(words: Vec<String>) -> String {
+        for word in words.iter() {
+            let s = word.as_bytes();
+            let mut left = 0;
+            let mut right = s.len() - 1;
+            while (left < right) {
+                if (s[left] != s[right]) {
+                    break;
+                }
+                left += 1;
+                right -= 1;
+            }
+            if left >= right {
+                return word.clone();
+            }
+        }
+        String::new()
+    }
+}
+```
+
+### **C**
+
+```c
+char *firstPalindrome(char **words, int wordsSize) {
+    for (int i = 0; i < wordsSize; i++) {
+        int left = 0;
+        int right = strlen(words[i]) - 1;
+        while (left < right) {
+            if (words[i][left] != words[i][right]) {
+                break;
+            }
+            left++;
+            right--;
+        }
+        if (left >= right) {
+            return words[i];
+        }
+    }
+    return "";
+}
 ```
 
 ### **...**

solution/2100-2199/2108.Find First Palindromic String in the Array/README_EN.md

@@ -135,7 +135,70 @@ func firstPalindrome(words []string) string {
 ### **TypeScript**
 
 ```ts
+function firstPalindrome(words: string[]): string {
+    for (const word of words) {
+        let left = 0;
+        let right = word.length - 1;
+        while (left < right) {
+            if (word[left] !== word[right]) {
+                break;
+            }
+            left++;
+            right--;
+        }
+        if (left >= right) {
+            return word;
+        }
+    }
+    return '';
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn first_palindrome(words: Vec<String>) -> String {
+        for word in words.iter() {
+            let s = word.as_bytes();
+            let mut left = 0;
+            let mut right = s.len() - 1;
+            while (left < right) {
+                if (s[left] != s[right]) {
+                    break;
+                }
+                left += 1;
+                right -= 1;
+            }
+            if left >= right {
+                return word.clone();
+            }
+        }
+        String::new()
+    }
+}
+```
+
+### **C**
+
+```c
+char *firstPalindrome(char **words, int wordsSize) {
+    for (int i = 0; i < wordsSize; i++) {
+        int left = 0;
+        int right = strlen(words[i]) - 1;
+        while (left < right) {
+            if (words[i][left] != words[i][right]) {
+                break;
+            }
+            left++;
+            right--;
+        }
+        if (left >= right) {
+            return words[i];
+        }
+    }
+    return "";
+}
 ```
 
 ### **...**

solution/2100-2199/2108.Find First Palindromic String in the Array/Solution.c

@@ -0,0 +1,17 @@
+char *firstPalindrome(char **words, int wordsSize) {
+    for (int i = 0; i < wordsSize; i++) {
+        int left = 0;
+        int right = strlen(words[i]) - 1;
+        while (left < right) {
+            if (words[i][left] != words[i][right]) {
+                break;
+            }
+            left++;
+            right--;
+        }
+        if (left >= right) {
+            return words[i];
+        }
+    }
+    return "";
+}

solution/2100-2199/2108.Find First Palindromic String in the Array/Solution.rs

@@ -0,0 +1,20 @@
+impl Solution {
+    pub fn first_palindrome(words: Vec<String>) -> String {
+        for word in words.iter() {
+            let s = word.as_bytes();
+            let mut left = 0;
+            let mut right = s.len() - 1;
+            while (left < right) {
+                if (s[left] != s[right]) {
+                    break;
+                }
+                left += 1;
+                right -= 1;
+            }
+            if left >= right {
+                return word.clone();
+            }
+        }
+        String::new()
+    }
+}

solution/2100-2199/2108.Find First Palindromic String in the Array/Solution.ts

@@ -0,0 +1,17 @@
+function firstPalindrome(words: string[]): string {
+    for (const word of words) {
+        let left = 0;
+        let right = word.length - 1;
+        while (left < right) {
+            if (word[left] !== word[right]) {
+                break;
+            }
+            left++;
+            right--;
+        }
+        if (left >= right) {
+            return word;
+        }
+    }
+    return '';
+}