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

No.0033.Search in Rotated Sorted Array

Author: YangFong

solution/0000-0099/0033.Search in Rotated Sorted Array/README.md

@@ -168,6 +168,38 @@ var search = function (nums, target) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l <= r {
+            let mid = l + r >> 1;
+            if nums[mid] == target {
+                return mid as i32;
+            }
+
+            if nums[l] <= nums[mid] {
+                if target < nums[mid] && target >= nums[l] {
+                    r = mid - 1;
+                } else {
+                    l = mid + 1;
+                }
+            } else {
+                if target > nums[mid] && target <= nums[r] {
+                    l = mid + 1;
+                } else {
+                    r = mid - 1;
+                }
+            }
+        }
+        -1
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md

@@ -144,6 +144,38 @@ var search = function (nums, target) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l <= r {
+            let mid = l + r >> 1;
+            if nums[mid] == target {
+                return mid as i32;
+            }
+
+            if nums[l] <= nums[mid] {
+                if target < nums[mid] && target >= nums[l] {
+                    r = mid - 1;
+                } else {
+                    l = mid + 1;
+                }
+            } else {
+                if target > nums[mid] && target <= nums[r] {
+                    l = mid + 1;
+                } else {
+                    r = mid - 1;
+                }
+            }
+        }
+        -1
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0033.Search in Rotated Sorted Array/Solution.rs

@@ -0,0 +1,27 @@
+impl Solution {
+    pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l <= r {
+            let mid = l + r >> 1;
+            if nums[mid] == target {
+                return mid as i32;
+            }
+
+            if nums[l] <= nums[mid] {
+                if target < nums[mid] && target >= nums[l] {
+                    r = mid - 1;
+                } else {
+                    l = mid + 1;
+                }
+            } else {
+                if target > nums[mid] && target <= nums[r] {
+                    l = mid + 1;
+                } else {
+                    r = mid - 1;
+                }
+            }
+        }
+        -1
+    }
+}