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

No.0088.Merge Sorted Array

Author: YangFong

solution/0000-0099/0088.Merge Sorted Array/README.md

@@ -148,6 +148,37 @@ var merge = function (nums1, m, nums2, n) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
+        let (mut m, mut n) = (m as usize, n as usize);
+        for i in (0..m + n).rev() {
+            nums1[i] = match (m == 0, n == 0) {
+                (true, false) => {
+                    n -= 1;
+                    nums2[n]
+                }
+                (false, true) => {
+                    m -= 1;
+                    nums1[m]
+                }
+                (_, _) => {
+                    if nums1[m - 1] > nums2[n - 1] {
+                        m -= 1;
+                        nums1[m]
+                    } else {
+                        n -= 1;
+                        nums2[n]
+                    }
+                }
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0088.Merge Sorted Array/README_EN.md

@@ -135,6 +135,37 @@ var merge = function (nums1, m, nums2, n) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
+        let (mut m, mut n) = (m as usize, n as usize);
+        for i in (0..m + n).rev() {
+            nums1[i] = match (m == 0, n == 0) {
+                (true, false) => {
+                    n -= 1;
+                    nums2[n]
+                }
+                (false, true) => {
+                    m -= 1;
+                    nums1[m]
+                }
+                (_, _) => {
+                    if nums1[m - 1] > nums2[n - 1] {
+                        m -= 1;
+                        nums1[m]
+                    } else {
+                        n -= 1;
+                        nums2[n]
+                    }
+                }
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0088.Merge Sorted Array/Solution.rs

@@ -0,0 +1,26 @@
+impl Solution {
+    pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
+        let (mut m, mut n) = (m as usize, n as usize);
+        for i in (0..m + n).rev() {
+            nums1[i] = match (m == 0, n == 0) {
+                (true, false) => {
+                    n -= 1;
+                    nums2[n]
+                }
+                (false, true) => {
+                    m -= 1;
+                    nums1[m]
+                }
+                (_, _) => {
+                    if nums1[m - 1] > nums2[n - 1] {
+                        m -= 1;
+                        nums1[m]
+                    } else {
+                        n -= 1;
+                        nums2[n]
+                    }
+                }
+            }
+        }
+    }
+}