Time: 0 ms (100.00%), Space: 41.7 MB (89.54%) - LeetHub

Author: karlosye

0033-search-in-rotated-sorted-array/0033-search-in-rotated-sorted-array.java

@@ -0,0 +1,22 @@
+// search the number in the rotated sorted array; solve this in n(logn) time
+
+// method: binary search-left&right pointer
+
+class Solution {
+  public int search(int[] nums, int target) {
+    int start = 0, end = nums.length - 1;
+    while (start <= end) {
+      int mid = start + (end - start) / 2;
+      if (nums[mid] == target) return mid;
+      else if (nums[mid] >= nums[start]) {
+        if (target >= nums[start] && target < nums[mid]) end = mid - 1;
+        else start = mid + 1;
+      }
+      else {
+        if (target <= nums[end] && target > nums[mid]) start = mid + 1;
+        else end = mid - 1;
+      }
+    }
+    return -1;
+  }
+}