LeetCode33：Search in Rotated Sorted Array

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Your algorithm's runtime complexity must be in the order of O(log n).

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

---

LeetCode：链接

变体：LeetCode81：Search in Rotated Sorted Array II

这题和剑指Offer_编程题06：旋转数组的最小数字(指针)思路差不多，都是和右边的边界比较。

二分法的关键在于获得中间数后，判断下面要搜索左半段还是右半段。如果中间的数小于最右边的数，说明右半段是有序的，如果中间的数大于最右边的数，说明左半段是有序的。我们只要在有序的半段里用首尾两个数组判断目标值是否在这一区域内，就可以确定保留哪半边了。

不需要考虑边界问题，就按正常二分法的思路做。

class Solution(object):
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        low, high = 0, len(nums) - 1
        while low <= high:
            mid = (low + high) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] > nums[high]:
                if nums[low] <= target < nums[mid]:
                    high = mid - 1
                else:
                    low = mid + 1
            else:
                if nums[mid] < target <= nums[high]:
                    low = mid + 1
                else:
                    high = mid - 1
        return -1