Leecode Week15: Search in Rotated Sorted Array

Week 15: Search in Rotated Sorted Array

Difficulty:Medium

1.Problem

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.

2.Algorithm

1.首先，判断输入数组是否为空，若为空则返回-1

2.若步骤1条件不满足，则使用二分法搜索旋转中心的位置，例如上例的中心是‘0’

3.找到旋转中心后，判断数据属于旋转中心前面的部分还是后面的部分

4.判断属于哪一部分之后，使用二分法找到是否存在target元素即可

3.Solution

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


        if(nums[rotate] <=  target && nums[end] >= target){
            start = rotate;
        }
        else end = rotate - 1;
        while(start < end) {
            int mid = (start+end) / 2;
            if(nums[mid] < target) start = mid+1;
            else if(nums[mid] > target) end = mid;
            else return mid;
        }
        if(nums[start] != target) {
            return -1;
        }
        else return start;
    }
};