LeetCode Search in Rotated Sorted Array

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.

分析：

给定排好序列的一个数组[0 1 2 3 4 5 6 7]可能存在的旋转有一下7种情况：
[ 0 1 2 4 5 6 7 ]
[ 7 0 1 2 4 5 6 ]
[ 6 7 0 1 2 4 5 ]
[ 5 6 7 0 1 2 4 ]
[ 4 5 6 7 0 1 2 ]
[ 2 4 5 6 7 0 1 ]
[ 1 2 4 5 6 7 0 ]
采用二分法对于给定的target进行查找，使用二分法确定mid后，判断要搜索左半段还是右半段，
（1）如果target==nums[mid]，那么mid就是我们要的结果，直接返回；
（2）如果nums[mid] < nums[last]，那么说明右半段一定是有序的（没有受到rotate的影响），那么我们只需要判断target是不是右半段，如果是则把左边缘移到mid+1，否则就target在左半段，即把右边缘移到mid;
（3）如果nums[mid]>=nums[last]，那么说明从左半段一定是有序的，同样只需要判断target是否在这个范围内，相应的移动边缘即可

C++实现：

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int first = 0, last = nums.size();
        while (first != last){
            const int mid = first + (last - last) / 2;
            if (nums[mid] == target)
                return mid;
            if (nums[first] <= nums[mid]){
                if (nums[first] <= target && nums[mid] > target)
                    last = mid;
                else
                    first = mid + 1;
            }
            else{
                if (nums[mid] < target && nums[last - 1] >= target)
                    first = mid + 1;
                else
                    last = mid;
            }
        }
        return -1;
    }
};

python实现：

class Solution(object):
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        start, end = 0, len(nums) - 1

        while start + 1 < end:
            mid = start + (end - start) / 2
            if nums[mid] == target:
                return mid
            if nums[start] <= nums[mid]:
                if nums[start] <= target <= nums[mid]:
                    end = mid
                else:
                    start = mid
            else:
                if nums[mid] <= target <= nums[end]:
                    start = mid
                else:
                    end = mid

        if nums[start] == target:
            return start
        if nums[end] == target:
            return end
        return -1