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

No.0153.Find Minimum in Rotated Sorted Array

Author: YangFong

solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README.md

@@ -162,6 +162,26 @@ var findMin = function (nums) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_min(nums: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let mid = l + (r - l) / 2;
+            if nums[mid] > nums[r] {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        nums[l]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README_EN.md

@@ -147,6 +147,26 @@ var findMin = function (nums) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_min(nums: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let mid = l + (r - l) / 2;
+            if nums[mid] > nums[r] {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        nums[l]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn find_min(nums: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let mid = l + (r - l) / 2;
+            if nums[mid] > nums[r] {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        nums[l]
+    }
+}