题目
Number: 81
Difficulty: Medium
Tags: Array, Binary Search
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.
题解
一个有序数组被从中间某个位置反转过一次,变为两部分有序的数组,从中找出目标值。可能有重复的值。
思路还是二分查找,但是需要仔细考虑每一种情况。
代码
bool 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;
if(nums[left] < nums[mid]){
if(nums[left] <= target && target < nums[mid])
right = mid - 1;
else
left = mid + 1;
}
else if(nums[mid] < nums[left]){
if(nums[mid] < target && target <= nums[right])
left = mid + 1;
else
right = mid - 1;
}
else left++;
}
return false;
}