Search_in_Rotated_Sorted_Array.java

class Solution {
  public int search(int[] nums, int target) {
    int n = nums.length;
    if (n == 0)
      return -1;
    int left = 0, right = n - 1;
    while (left <= right) {
      int mid = left + (right - left) / 2;
      if (nums[mid] == target)
        return mid;
      if (nums[mid] >= nums[left]) {
        if (nums[mid] >= target && nums[left] <= target) {
          right = mid - 1;
        } else {
          left = mid + 1;
        }
      } else {
        if (nums[mid] <= target && nums[right] >= target) {
          left = mid + 1;
        } else {
          right = mid - 1;
        }
      }
    }
    return -1;
  }
}