update: 33

Author: hijiangtao

src/search-in-rotated-sorted-array/res.js

@@ -53,4 +53,22 @@ let search = function(nums, target) {
     }
 
     return -1;
-};
+};
+
+const search_2 = (nums, target) => {
+    let lo = 0, hi = nums.length - 1;
+
+    while (lo < hi) {
+        let mid = (lo + hi) >> 1;
+
+        if (nums[0] <= nums[mid] && (target > nums[mid] || target < nums[0])) {
+            lo = mid + 1;
+        } else if (target < nums[0] && target > nums[mid]) {
+            lo = mid + 1;
+        } else {
+            hi = mid;
+        }
+    }
+
+    return lo == hi && nums[lo] == target ? lo : -1;
+}