LC 33. Search in Rotated Sorted Array (Rust BS)

Author: raul-sauco

README.md

@@ -44,7 +44,7 @@ Solutions to LeetCode problems. The first column links to the problem in LeetCod
 | [27. Remove Element][lc27]                                                                    | 🟢 Easy    | [![python](res/py.png)][lc27py]                                                                       |
 | [28. Find the Index of the First Occurrence in a String][lc28]                                | 🟠 Medium  | [![python](res/py.png)][lc28py] [![rust](res/rs.png)][lc28rs]                                         |
 | [29. Divide two integers][lc29]                                                               | 🟠 Medium  | [![python](res/py.png)][lc29py]                                                                       |
-| [33. Search in Rotated Sorted Array][lc33]                                                    | 🟠 Medium  | [![python](res/py.png)][lc33py]                                                                       |
+| [33. Search in Rotated Sorted Array][lc33]                                                    | 🟠 Medium  | [![python](res/py.png)][lc33py] [![rust](res/rs.png)][lc33rs]                                         |
 | [34. Find First and Last Position of Element in Sorted Array][lc34]                           | 🟠 Medium  | [![python](res/py.png)][lc34py]                                                                       |
 | [35. Search Insert Position][lc35]                                                            | 🟢 Easy    | [![python](res/py.png)][lc35py] [![rust](res/rs.png)][lc35rs]                                         |
 | [36. Valid Sudoku][lc36]                                                                      | 🟠 Medium  | [![python](res/py.png)][lc36py]                                                                       |
@@ -647,6 +647,7 @@ Solutions to LeetCode problems. The first column links to the problem in LeetCod
 [lc29py]: leetcode/divide-two-integers.py
 [lc33]: https://leetcode.com/problems/search-in-rotated-sorted-array/
 [lc33py]: leetcode/search-in-rotated-sorted-array.py
+[lc33rs]: leetcode/search-in-rotated-sorted-array.rs
 [lc34]: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
 [lc34py]: leetcode/find-first-and-last-position-of-element-in-sorted-array.py
 [lc35]: https://leetcode.com/problems/search-insert-position/

leetcode/search-in-rotated-sorted-array.rs

@@ -0,0 +1,57 @@
+// 33. Search in Rotated Sorted Array
+// 🟠 Medium
+//
+// https://leetcode.com/problems/search-in-rotated-sorted-array/
+//
+// Tags: Array - Binary Search
+
+struct Solution;
+impl Solution {
+    /// Neat idea and explanation found here:
+    /// https://leetcode.com/problems/search-in-rotated-sorted-array/solutions/14435/clever-idea-making-it-simple/
+    ///
+    /// Time complexity: O(log(n)) - The algorithm works like a binary search
+    /// with an extra if statement executed in each iteration.
+    /// Space complexity: O(1) - We use constant extra space.
+    ///
+    /// Runtime 1 ms Beats 68.47%
+    /// Memory 2 MB Beats 79.73%
+    pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+        let (mut l, mut r) = (0, nums.len());
+        let mut num;
+        let mut mid;
+        while l < r {
+            mid = (l + r) / 2;
+            num = if (nums[mid] < nums[0]) == (target < nums[0]) {
+                nums[mid]
+            } else {
+                if target < nums[0] {
+                    i32::MIN
+                } else {
+                    i32::MAX
+                }
+            };
+            if num < target {
+                l = mid + 1;
+            } else if num > target {
+                r = mid;
+            } else {
+                return mid as i32;
+            }
+        }
+        -1
+    }
+}
+
+// Tests.
+fn main() {
+    let tests = [
+        (vec![1], 0, -1),
+        (vec![4, 5, 6, 7, 0, 1, 2], 0, 4),
+        (vec![4, 5, 6, 7, 0, 1, 2], 3, -1),
+    ];
+    for t in tests {
+        assert_eq!(Solution::search(t.0, t.1), t.2);
+    }
+    println!("\x1b[92m» All tests passed!\x1b[0m");
+}