feat: add rust solution to lcof problem: No.11

剑指 Offer 11. 旋转数组的最小数字

Author: YangFong

lcof/面试题11. 旋转数组的最小数字/README.md

@@ -125,6 +125,26 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_array(numbers: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = numbers.len() - 1;
+        while l < r {
+            let mid = l + r >> 1;
+            match numbers[mid].cmp(&numbers[r]) {
+                std::cmp::Ordering::Less => r = mid,
+                std::cmp::Ordering::Equal => r -= 1,
+                std::cmp::Ordering::Greater => l = mid + 1,
+            }
+        }
+        numbers[l]
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题11. 旋转数组的最小数字/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn min_array(numbers: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = numbers.len() - 1;
+        while l < r {
+            let mid = l + r >> 1;
+            match numbers[mid].cmp(&numbers[r]) {
+                std::cmp::Ordering::Less => r = mid,
+                std::cmp::Ordering::Equal => r -= 1,
+                std::cmp::Ordering::Greater => l = mid + 1,
+            }
+        }
+        numbers[l]
+    }
+}