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

No.0035.Search Insert Position

Author: YangFong

solution/0000-0099/0035.Search Insert Position/README.md

@@ -155,6 +155,28 @@ var searchInsert = function (nums, target) {
 };
 ```
 
+### **Rust**
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len();
+        while l < r {
+            let mid = l + (r - l) / 2;
+            match nums[mid].cmp(&target) {
+                Ordering::Less => l = mid + 1,
+                Ordering::Greater => r = mid,
+                Ordering::Equal => return mid as i32,
+            }
+        }
+        l as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0035.Search Insert Position/README_EN.md

@@ -131,6 +131,28 @@ var searchInsert = function (nums, target) {
 };
 ```
 
+### **Rust**
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len();
+        while l < r {
+            let mid = l + (r - l) / 2;
+            match nums[mid].cmp(&target) {
+                Ordering::Less => l = mid + 1,
+                Ordering::Greater => r = mid,
+                Ordering::Equal => return mid as i32,
+            }
+        }
+        l as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0035.Search Insert Position/Solution.rs

@@ -0,0 +1,17 @@
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len();
+        while l < r {
+            let mid = l + (r - l) / 2;
+            match nums[mid].cmp(&target) {
+                Ordering::Less => l = mid + 1,
+                Ordering::Greater => r = mid,
+                Ordering::Equal => return mid as i32,
+            }
+        }
+        l as i32
+    }
+}