feat: add rust solution to lc problem: No.0009

No.0009.Palindrome Number

Author: YangFong

solution/0000-0099/0009.Palindrome Number/README.md

@@ -128,6 +128,48 @@ func isPalindrome(x int) bool {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn is_palindrome(x: i32) -> bool {
+        if x < 0 {
+            return false;
+        }
+        let s = x.to_string();
+        let bs = s.as_bytes();
+        let n = bs.len();
+        let mut l = 0;
+        let mut r = n - 1;
+        while l < r {
+            if bs[l] != bs[r] {
+                return false;
+            }
+            l += 1;
+            r -= 1;
+        }
+        true
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn is_palindrome(mut x: i32) -> bool {
+        if x < 0 || (x % 10 == 0 && x != 0) {
+            return false;
+        }
+        let mut y = 0;
+        while x > y {
+            y *= 10;
+            y += x % 10;
+            x /= 10;
+        }
+        x == y || x == y / 10
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0009.Palindrome Number/README_EN.md

@@ -118,6 +118,48 @@ func isPalindrome(x int) bool {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn is_palindrome(x: i32) -> bool {
+        if x < 0 {
+            return false;
+        }
+        let s = x.to_string();
+        let bs = s.as_bytes();
+        let n = bs.len();
+        let mut l = 0;
+        let mut r = n - 1;
+        while l < r {
+            if bs[l] != bs[r] {
+                return false;
+            }
+            l += 1;
+            r -= 1;
+        }
+        true
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn is_palindrome(mut x: i32) -> bool {
+        if x < 0 || (x % 10 == 0 && x != 0) {
+            return false;
+        }
+        let mut y = 0;
+        while x > y {
+            y *= 10;
+            y += x % 10;
+            x /= 10;
+        }
+        x == y || x == y / 10
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0009.Palindrome Number/Solution.rs

@@ -0,0 +1,14 @@
+impl Solution {
+    pub fn is_palindrome(mut x: i32) -> bool {
+        if x < 0 || (x % 10 == 0 && x != 0) {
+            return false;
+        }
+        let mut y = 0;
+        while x > y {
+            y *= 10;
+            y += x % 10;
+            x /= 10;
+        }
+        x == y || x == y / 10
+    }
+}