feat: add rust solution to lc problem: No.0075 (doocs#682)

No.0075.Sort Colors

Author: YangFong

solution/0000-0099/0075.Sort Colors/README.md

@@ -187,6 +187,41 @@ func sortColors(nums []int) {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sort_colors(nums: &mut Vec<i32>) {
+        let len = nums.len();
+        if len < 2 {
+            return;
+        }
+
+        let mut l = 0;
+        let mut r = len - 1;
+        let mut i = 0;
+        while i <= r {
+            match nums[i] {
+                0 => {
+                    nums.swap(i, l);
+                    l += 1;
+                    i += 1;
+                }
+                2 => {
+                    nums.swap(i, r);
+                    // usize 不可为负数，会导致 Rust panic
+                    match r {
+                        0 => return,
+                        _ => r -= 1,
+                    }
+                }
+                _ => i += 1,
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0075.Sort Colors/README_EN.md

@@ -158,6 +158,40 @@ func sortColors(nums []int) {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sort_colors(nums: &mut Vec<i32>) {
+        let len = nums.len();
+        if len < 2 {
+            return;
+        }
+
+        let mut l = 0;
+        let mut r = len - 1;
+        let mut i = 0;
+        while i <= r {
+            match nums[i] {
+                0 => {
+                    nums.swap(i, l);
+                    l += 1;
+                    i += 1;
+                }
+                2 => {
+                    nums.swap(i, r);
+                    match r {
+                        0 => return,
+                        _ => r -= 1,
+                    }
+                }
+                _ => i += 1,
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0075.Sort Colors/Solution.rs

@@ -0,0 +1,29 @@
+impl Solution {
+    pub fn sort_colors(nums: &mut Vec<i32>) {
+        let len = nums.len();
+        if len < 2 {
+            return;
+        }
+
+        let mut l = 0;
+        let mut r = len - 1;
+        let mut i = 0;
+        while i <= r {
+            match nums[i] {
+                0 => {
+                    nums.swap(i, l);
+                    l += 1;
+                    i += 1;
+                }
+                2 => {
+                    nums.swap(i, r);
+                    match r {
+                        0 => return,
+                        _ => r -= 1,
+                    }
+                }
+                _ => i += 1,
+            }
+        }
+    }
+}