feat: add rust solution to lcof2 problem: No.006

剑指 Offer II 006. 排序数组中两个数字之和

Author: YangFong

lcof2/剑指 Offer II 006. 排序数组中两个数字之和/README.md

@@ -148,6 +148,52 @@ class Solution
 };
 ```
 
+### **Rust**
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
+        let n = numbers.len();
+        let mut l = 0;
+        let mut r = n - 1;
+        loop {
+            match target.cmp(&(numbers[l] + numbers[r])) {
+                Ordering::Less => r -= 1,
+                Ordering::Greater => l += 1,
+                Ordering::Equal => break,
+            }
+        }
+        vec![l as i32, r as i32]
+    }
+}
+```
+
+```rust
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
+        let n = numbers.len();
+        for i in 0..n - 1 {
+            let num = target - numbers[i];
+            let mut l = i + 1;
+            let mut r = n - 1;
+            while l <= r {
+                let mid = l + (r - l) / 2;
+                match num.cmp(&numbers[mid]) {
+                    Ordering::Less => r = mid - 1,
+                    Ordering::Greater => l = mid + 1,
+                    Ordering::Equal => return vec![i as i32, mid as i32],
+                }
+            }
+        }
+        vec![-1, -1]
+    }
+}
+```
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 006. 排序数组中两个数字之和/Solution.rs

@@ -0,0 +1,17 @@
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
+        let n = numbers.len();
+        let mut l = 0;
+        let mut r = n - 1;
+        loop {
+            match target.cmp(&(numbers[l] + numbers[r])) {
+                Ordering::Less => r -= 1,
+                Ordering::Greater => l += 1,
+                Ordering::Equal => break,
+            }
+        }
+        vec![l as i32, r as i32]
+    }
+}