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

No.0905.Sort Array By Parity

Author: YangFong

solution/0900-0999/0905.Sort Array By Parity/README.md

@@ -107,6 +107,26 @@ var sortArrayByParity = function (A) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sort_array_by_parity(mut nums: Vec<i32>) -> Vec<i32> {
+        let (mut l, mut r) = (0, nums.len() - 1);
+        while l < r {
+            while l < r && nums[l] & 1 == 0 {
+                l += 1;
+            }
+            while l < r && nums[r] & 1 == 1 {
+                r -= 1;
+            }
+            nums.swap(l, r);
+        }
+        nums
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0905.Sort Array By Parity/README_EN.md

@@ -103,6 +103,26 @@ var sortArrayByParity = function (A) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sort_array_by_parity(mut nums: Vec<i32>) -> Vec<i32> {
+        let (mut l, mut r) = (0, nums.len() - 1);
+        while l < r {
+            while l < r && nums[l] & 1 == 0 {
+                l += 1;
+            }
+            while l < r && nums[r] & 1 == 1 {
+                r -= 1;
+            }
+            nums.swap(l, r);
+        }
+        nums
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0905.Sort Array By Parity/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn sort_array_by_parity(mut nums: Vec<i32>) -> Vec<i32> {
+        let (mut l, mut r) = (0, nums.len() - 1);
+        while l < r {
+            while l < r && nums[l] & 1 == 0 {
+                l += 1;
+            }
+            while l < r && nums[r] & 1 == 1 {
+                r -= 1;
+            }
+            nums.swap(l, r);
+        }
+        nums
+    }
+}