Update Solution.rs

Author: yanglbme

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

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