33. Search in Rotated Sorted Array
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.
int search(vector<int>& nums, int target) {
int len = nums.size();
if(len <= 0)
return -1;
int start = 0;
int end = len-1;
while(start < end)
{
int mid = start + (end - start) / 2;
if(nums[mid] == target)
return mid;
else if(nums[start] <= nums[mid])
{
if(target >= nums[start] && target <= nums[mid])
end = mid - 1;
else
start = mid + 1;
}
else
{
if(target >= nums[mid] && target <= nums[end])
start = mid + 1;
else
end = mid - 1;
}
}
return nums[start]==target ? start : -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?
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
).
Write a function to determine if a given target is in the array.
The array may contain duplicates.
bool search(vector<int>& nums, int target) {
int len = nums.size();
if(len <= 0)
return false;
int start = 0;
int end = len-1;
while(start < end)
{
int mid = start + (end - start) / 2;
if(nums[mid] == target)
return true;
if(nums[mid]>nums[end])
{
if(nums[mid]>target && nums[start] <= target)
end = mid;
else
start = mid + 1;
}
else if(nums[mid] < nums[end])
{
if(nums[mid]<target && nums[end] >= target)
start = mid + 1;
else
end = mid;
}
else
{
end--;
}
}
return nums[start]==target ? true : false;
}
bool search(vector<int>& nums, int target) {
int len = nums.size();
if(len <= 0)
return false;
int start = 0;
int end = len-1;
while(start < end)
{
int mid = start + (end - start) / 2;
if(nums[mid] == target)
return true;
if(nums[start] < nums[mid])
{
if(target >= nums[start] && target < nums[mid])
end = mid - 1;//当nums[start]<=target<nums[mid时,此时只需要改变end,start不需要改变,所以if条件才这样设置
else
start = mid + 1;
}
else if(nums[start] > nums[mid])
{
if(target > nums[mid] && target <= nums[end])
start = mid + 1;
else
end = mid - 1;
}
else
start++;
}
return nums[start]==target ? true : false;
}