[LeetCode] 33. 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.
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

解析

在旋转后的排序数组中找到给定值的位置，一般排序算法都是用二分法进行查找，可以达到logN的复杂度。
找到中间点mid，如果mid值大于最右边的值，可以知道mid左边的数组是排好序的，如果mid值小于或等于右边值，则mid右边数组是排好序的。然后就判断target在mid的左边还是右边，进行二分查找。

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int size=nums.size();
        int left = 0;
        int right = size-1;
        while(left <= right){
            int mid = (left+right)>>1;
            if(nums[mid] == target)
                return mid;
            else if(nums[mid] > nums[right]){  //在左边
                if(target >= nums[left] && target < nums[mid])
                    right = mid-1;
                else
                    left = mid+1;
            }
            else                               //在右边
            {
                if(target > nums[mid] && target <= nums[right])
                    left = mid + 1;
                else
                    right = mid -1;
            } 
        }
        return -1;
    }
};

参考

http://www.cnblogs.com/grandyang/p/4325648.html
https://leetcode.com/problems/search-in-rotated-sorted-array/discuss/14616/C%2B%2B-binary-search-with-comments-easy-to-read-and-understand