Leecode #33 Search in Rotated Sorted Array

一、 问题描述

Leecode第三十三题，题目为：

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

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

        
        

        
    }
};