33. Search in Rotated Sorted Array
Medium
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.
Your algorithm's runtime complexity must be in the order of O(log n).
Example 1:
Input: nums = [4,5,6,7,0,1,2]
, target = 0
Output: 4
Example 2:
Input: nums = [4,5,6,7,0,1,2]
, target = 3
Output: -1
参考:https://blog.csdn.net/qq_26410101/article/details/80665577
解题思路:
既然要求时间复杂度是O(log n), 那么应该是二分法。从题目中可以看到这个数组是有序的,如果把数组从中间分成两部分,那么至少有一部分是有序的,那么如何确定那部分数组是有序的?当计算出这个数列的中间的数时,也就是(left+right)/2,如何mid>right,则左边的数列是有序的。如果mid<right, 则右边的数列是有序的。当找出了那一部分是有序数列后,就可以使用二分法找了(二分法的前提是数列必须是有序的)。如果如果该数在有序的那部分数列里,则二分查找,如果该数在不确定是否是有序数列里面,则继续将该数列分成两部分,找到有序的那部分,然后就回到了上面的步骤。
如果不理解上述思路,可以参考提供的链接,里面有样例,可以帮助理解。
注意:在进行二分查找的时候,改变left和right 的值的时候,必须是left,right=mid+1或mid-1, 不能是left,right = mid,否则会一直陷入死循环。
class Solution {
public:
int search(vector<int>& nums, int target) {
int cnt = nums.capacity();
int left = 0, right = cnt-1;
int mid = cnt / 2;
while(left<=right) {
mid = (left + right) / 2;
if(nums[mid]==target) return mid;
if(nums[mid] > nums[right]) {
// left
if(target>=nums[left] && target <=nums[mid]) {
right = mid-1;
}
else {
left = mid+1;
}
}
else {
if(target>=nums[mid] && target <=nums[right]) {
left = mid+1;
}
else {
right = mid-1;
}
}
}
return -1;
}
};