33. Search in Rotated Sorted Array（重要，难点！！！！）

一、33. Search in Rotated Sorted Array

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.

大致思路：

1.先判断nums[mid]是在左边还是右边；

2.如果在左边，1）如果target>nums[mid],left=mid+1;

2)否则，就要分情况，通过比较target和nums[left]的大小判断它在左边还是在右边。

3.如果在右边，类似。

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

二、81. Search in Rotated Sorted Array II

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.

代码几乎一样，就改一点，当nums[mid]跟边界nums[left]相等时，left++，递增搜索。

这样，算法最差情况时间复杂度是O(N)

class Solution {
public:
	int search(vector<int>& nums, int target) {
		int left = 0, right = nums.size() - 1;
		while (left <= right){
			int mid = left + (right - left) / 2;
			if (nums[mid] == target){
				return true;
			}
			else if (nums[mid]>nums[left]){
				if (target > nums[mid]){
					left = mid + 1;
				}
				else{
					if (target >= nums[left]){
						right = mid - 1;
					}
					else{
						left = mid + 1;
					}
				}
			}
			else if(nums[mid]<nums[left]){
				if (target < nums[mid]){
					right = mid - 1;
				}
				else{
					if (target <= nums[right]){
						left = mid + 1;
					}
					else{
						right = mid - 1;
					}
				}
			}
			else{
				left++;//改这一点
			}
		}
		return false;
	}
};