搜索旋转排序数组

[lzxjack]

No description provided.

[lzxjack]

const search = (nums, target) => {
  let [left, right] = [0, nums.length - 1];

  while (left <= right) {
    const mid = (left + right) >> 1;
    if (nums[mid] === target) return mid;
    if (nums[left] < nums[mid]) {
      // 左边是升序区间
      if (nums[left] <= target && target <= nums[mid]) {
        // 目标值在升序区间内
        right = mid - 1;
      } else {
        // 目标值不在升序区间内
        left = mid + 1;
      }
    } else {
      // 右边是升序区间
      if (nums[mid] <= target && target <= nums[right]) {
        // 目标值在升序区间内
        left = mid + 1;
      } else {
        // 目标值不在升序区间内
        right = mid - 1;
      }
    }
  }

  return nums[left + 1] === target ? left + 1 : -1;
};