feat: add rust solution to lc problems: No.0035,0852

- No.0035.Search Insert Position
- No.0852.Peak Index in a Mountain Array

Author: YangFong

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

@@ -152,20 +152,19 @@ var searchInsert = function (nums, target) {
 
 ```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;
+        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 => l = mid + 1,
-                Ordering::Greater => r = mid,
+                Ordering::Less => left = mid + 1,
+                Ordering::Greater => right = mid,
                 Ordering::Equal => return mid as i32,
             }
         }
-        l as i32
+        left as i32
     }
 }
 ```

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

@@ -142,20 +142,19 @@ var searchInsert = function (nums, target) {
 
 ```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;
+        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 => l = mid + 1,
-                Ordering::Greater => r = mid,
+                Ordering::Less => left = mid + 1,
+                Ordering::Greater => right = mid,
                 Ordering::Equal => return mid as i32,
             }
         }
-        l as i32
+        left as i32
     }
 }
 ```

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

@@ -1,17 +1,16 @@
 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;
+        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 => l = mid + 1,
-                Ordering::Greater => r = mid,
+                Ordering::Less => left = mid + 1,
+                Ordering::Greater => right = mid,
                 Ordering::Equal => return mid as i32,
             }
         }
-        l as i32
+        left as i32
     }
 }

solution/0800-0899/0852.Peak Index in a Mountain Array/README.md

@@ -192,6 +192,26 @@ function peakIndexInMountainArray(arr: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
+        let mut left = 1;
+        let mut right = arr.len() - 2;
+        while left < right {
+            let mid = left + (right - left) / 2;
+            if arr[mid] > arr[mid + 1] {
+                right = mid;
+            } else {
+                left = left + 1;
+            }
+        }
+        left as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0852.Peak Index in a Mountain Array/README_EN.md

@@ -167,6 +167,26 @@ function peakIndexInMountainArray(arr: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
+        let mut left = 1;
+        let mut right = arr.len() - 2;
+        while left < right {
+            let mid = left + (right - left) / 2;
+            if arr[mid] > arr[mid + 1] {
+                right = mid;
+            } else {
+                left = left + 1;
+            }
+        }
+        left as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0852.Peak Index in a Mountain Array/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn peak_index_in_mountain_array(arr: Vec<i32>) -> i32 {
+        let mut left = 1;
+        let mut right = arr.len() - 2;
+        while left < right {
+            let mid = left + (right - left) / 2;
+            if arr[mid] > arr[mid + 1] {
+                right = mid;
+            } else {
+                left = left + 1;
+            }
+        }
+        left as i32
+    }
+}