LeetCode:Search in Rotated Sorted Array

Search in Rotated Sorted Array

Total Accepted: 104896  Total Submissions: 343548  Difficulty: Hard

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.

Subscribe to see which companies asked this question

Hide Tags

  Binary Search Array

Hide Similar Problems

  (M) Search in Rotated Sorted Array II (M) Find Minimum in Rotated Sorted Array

思路一：

先二分找出数组中最小值的下标，将数组分成两部分，然后在其中一部分再二分查找target。

c++ code:

class Solution {
public:
    int search(vector<int>& nums, int target) {
        
        int minIdx = findMinIndex(nums);
        
        if(target == nums[minIdx]) return minIdx;
        
        int n = nums.size();
        int lo, hi;
        if (target <= nums[n-1]) {
    		lo = minIdx;
    		hi = n - 1;
    	}
    	else{
    		lo = 0;
    		hi = minIdx;
    	}
        
        while(lo <= hi) {
            
            int mid = (lo + hi)/2;
            if(target == nums[mid])
                return mid;
            else if(target < nums[mid])
                hi = mid - 1;
            else
                lo = mid + 1;
        }
        return -1;
    }
    
    // 自定义函数
    int findMinIndex(vector<int>& nums) {
        
        int lo = 0, hi = nums.size() - 1;
    	while (lo < hi) {
    
    		int mid = (lo + hi) / 2;
    		if (nums[mid] > nums[hi])
    			lo = mid + 1;
    		else
    			hi = mid;
    	}
    	return lo;
    }
};

思路二：

直接二分查找。

java code:

public class Solution {
    public int search(int[] nums, int target) {
        
        int lo = 0, hi = nums.length-1;
        while(lo <= hi) {
            
            int mid = lo + (hi-lo)/2;
            if(target == nums[mid]) return mid;
            
            if(nums[lo] <= nums[mid]) {
                if(nums[lo] <= target && target <= nums[mid])
                    hi = mid - 1;
                else
                    lo = mid + 1;
            }else{
                if(nums[mid] <= target && target <= nums[hi])
                    lo = mid + 1;
                else
                    hi = mid - 1;
            }
        }
        
        return -1;
    }
}