LintCode 62. Search in Rotated Sorted Array

题目

Suppose a sorted array 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.
Have you met this question in a real interview?
Yes
Example
For [4, 5, 1, 2, 3] and target=1, return 2.
For [4, 5, 1, 2, 3] and target=0, return -1.
Challenge
O(logN) time
Tags
Binary Search LinkedIn Array Facebook Sorted Array Uber

思路

略微有点复杂的二分。
1.$A[left]<A[right]$,正常二分
2.$A[left]>A[right]$,$A[mid]<A[right]$,旋转数组右边
3.$A[left]<A[right]$,$A[mid]>A[right]$,旋转数组左边

代码

class Solution:
    """
    @param: A: an integer rotated sorted array
    @param: target: an integer to be searched
    @return: an integer
    """
    def search(self, A, target):
        # write your code here
        left = 0; right = len(A) - 1
        while left <= right:
            mid = left + (right - left) // 2
            if A[mid] == target:
                return mid
            if A[left] < A[right]:
                if A[mid] < target:
                    left = mid + 1
                else:
                    right = mid - 1
            elif A[mid] < A[right]:
                if A[mid] > target:
                    right = mid - 1
                elif A[right] < target:
                    right = mid - 1
                else:
                    left = mid + 1
            else:
                if A[mid] < target:
                    left = mid + 1
                elif A[left] > target:
                    left = mid + 1
                else:
                    right = mid - 1
        return -1