Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,0,1,2,2,5,6]
might become [2,5,6,0,0,1,2]
).
You are given a target value to search. If found in the array return true
, otherwise return false
.
Example 1:
Input: nums = [2,5,6,0,0,1,2], target = 0 Output: true
Example 2:
Input: nums = [2,5,6,0,0,1,2], target = 3 Output: false
Follow up:
- This is a follow up problem to Search in Rotated Sorted Array, where
nums
may contain duplicates. - Would this affect the run-time complexity? How and why?
解题思路:在33题的基础上进行改进。
每次从中间划分后,必然有一个为升序序列,一个为旋转,对于升序序列而言,二分法是我们熟悉的,其最小值和最大值也很好判断,因此我们直接判断target是否在升序序列那边,不在的话就在旋转序列。
首先比较mid的值与right的值,由此判断右半部是否为旋转序列:
①若nums[mid] < nums[right],有右部分为升序序列。
对右部分而言,最小值为nums[mid],最大值为nums[right],假设target介于之间,有target在右半部,否则为左半部。
②若nums[mid] > nums[right],有右部分为旋转序列,那么就对左半部进行分析
对左部分而言,最小值为nums[left],最大值为nums[mid],假设target介于之间,有target在左半部,否则为右半部。
③若nums[mid] == nums[right],右部分可能为旋转序列,可能为升序序列
直接right-1
class Solution {
public:
bool search(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1;
while(left <= right){
int mid = left + ((right - left) >> 1);
if(nums[mid] == target)
return true;
if(nums[mid] < nums[right]){
if(nums[mid] < target && nums[right] >= target)
left = mid + 1;
else
right = mid - 1;
}
else if(nums[mid] > nums[right]){
if(nums[mid] > target && nums[left] <= target)
right = mid - 1;
else
left = mid + 1;
}
else
-- right;
}
return false;
}
};