LeetCode 33. Search in Rotated Sorted Array ( Binary Search二分搜索 ）C++

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).

假设按照升序排序的数组在预先未知的某个点上进行了旋转。

( 例如，数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。

搜索一个给定的目标值，如果数组中存在这个目标值，则返回它的索引，否则返回 -1 。

你可以假设数组中不存在重复的元素。

你的算法时间复杂度必须是 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

C++(二分搜索）

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int n = nums.size();
        if(n == 0) return -1;
        if(n == 1) return target == nums[0] ? 0 : -1;
		int low = 0 ,high = n - 1;
		while(low <= high){
			int mid = (low + high) / 2;
			if(nums[mid] == target) return mid;
			//0 - mid区间有序 
			if(nums[0] <=  nums[mid] ){
				if(nums[0] <= target && target <= nums[mid] ){//target在0 - mid之内
					high = mid - 1;
				}else{
					low = mid + 1;
				}
			//mid + 1 之后的区间有序	
			}else{
				if(nums[mid] <= target && target <= nums[n - 1]){//target在mid + 1之后
					low = mid + 1;
				}else{
					high = mid - 1;
				}
			}
		} 
		return -1; 
    }
};