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

No.0367.Valid Perfect Square

Author: YangFong

solution/0300-0399/0367.Valid Perfect Square/README.md

@@ -159,6 +159,42 @@ func isPerfectSquare(num int) bool {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn is_perfect_square(mut num: i32) -> bool {
+        let num: i64 = num as i64;
+        let mut l = 0;
+        let mut r = num;
+        while l < r {
+            let mid = l + (r - l) / 2;
+            match (mid * mid).cmp(&num) {
+                Ordering::Less => l = mid + 1,
+                Ordering::Greater => r = mid - 1,
+                Ordering::Equal => return true,
+            }
+        }
+        r * r == num
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn is_perfect_square(mut num: i32) -> bool {
+        let mut i = 1;
+        while num > 0 {
+            num -= i;
+            i += 2;
+        }
+        num == 0
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0300-0399/0367.Valid Perfect Square/README_EN.md

@@ -136,6 +136,42 @@ func isPerfectSquare(num int) bool {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn is_perfect_square(mut num: i32) -> bool {
+        let num: i64 = num as i64;
+        let mut l = 0;
+        let mut r = num;
+        while l < r {
+            let mid = l + (r - l) / 2;
+            match (mid * mid).cmp(&num) {
+                Ordering::Less => l = mid + 1,
+                Ordering::Greater => r = mid - 1,
+                Ordering::Equal => return true,
+            }
+        }
+        r * r == num
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn is_perfect_square(mut num: i32) -> bool {
+        let mut i = 1;
+        while num > 0 {
+            num -= i;
+            i += 2;
+        }
+        num == 0
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0300-0399/0367.Valid Perfect Square/Solution.rs

@@ -0,0 +1,18 @@
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn is_perfect_square(mut num: i32) -> bool {
+        let num: i64 = num as i64;
+        let mut l = 0;
+        let mut r = num;
+        while l < r {
+            let mid = l + (r - l) / 2;
+            match (mid * mid).cmp(&num) {
+                Ordering::Less => l = mid + 1,
+                Ordering::Greater => r = mid - 1,
+                Ordering::Equal => return true,
+            }
+        }
+        r * r == num
+    }
+}