81 Search in Rotated Sorted Array II
1. Question
Follow up for "Search in Rotated Sorted Array": What ifduplicatesare 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 become4 5 6 7 0 1 2
).
Write a function to determine if a given target is in the array.
The array may contain duplicates.
2. Implementation
(1) Binary Search
class Solution {
public boolean search(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return false;
}
int start = 0, end = nums.length - 1, mid = 0;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (nums[mid] == target) {
return true;
}
else if (nums[mid] < nums[end]) {
if (nums[mid] < target && target <= nums[end]) {
start = mid + 1;
}
else {
end = mid - 1;
}
}
else if (nums[mid] > nums[end]) {
if (nums[start] <= target && target < nums[mid]) {
end = mid - 1;
}
else {
start = mid + 1;
}
}
else {
--end;
}
}
return nums[start] == target || nums[end] == target;
}
}
3. Time & Space Complexity
时间复杂度O(logn),空间复杂度O(1)
Last updated
Was this helpful?