leetcode 33. 搜索旋转排序数组
分析: 首先题目要求实现一个算法复杂度为 O ( l o g n ) O(log n) O(logn) 的算法,因为是排序好的数组,可以采用二分法找到旋转点,然后确定区间,再使用一次二分法查找目标值;一共使用两次二分法,所以时间复杂度为 O ( l o g n ) O(logn) O(logn)
解题步骤:
-
首先使用二分法来寻找最旋转点
int n = nums.size() - 1; int left = 0, right = n; while (left < right) { int mid = (right - left) / 2 + left; if (nums[mid] < nums[right]) { right = mid; } else if (nums[mid] >= nums[right]) { left = mid + 1; } }
在这里使用的是开区间;
-
找到旋转点以后,确定目标值所在的区间
if (target >= nums[left] && target <= nums[n]) { right = n; } else { left = 0; right = right - 1; }
假设目标值大于旋转点且目标值小于最后一个元素,则目标值在旋转点的右边,这时将右边界right赋值为n,否则在旋转点的左边,此时将左边界设置为0,右边界为旋转点的前一个
-
上述划分区间后,左右边界都是有效的,第二次使用二分法的时候就在闭区间中进行查找
while (left <= right) { int mid = (right - left) / 2 + left; if (nums[mid] < target) { left = mid + 1; } else if (nums[mid] > target) { right = mid -1; } else return mid; }
-
若没找到目标值,则返回-1;
完整代码:
int search(vector<int>& nums, int target) {
int n = nums.size() - 1;
int left = 0, right = n;
while (left < right) {
int mid = (right - left) / 2 + left;
if (nums[mid] < nums[right]) {
right = mid;
} else if (nums[mid] >= nums[right]) {
left = mid + 1;
}
}
// cout << left << " " << right << endl;
if (target >= nums[left] && target <= nums[n]) {
right = n;
} else {
left = 0;
right = right - 1;
}
// cout << left << " " << right << endl;
while (left <= right) {
int mid = (right - left) / 2 + left;
if (nums[mid] < target) {
left = mid + 1;
} else if (nums[mid] > target) {
right = mid -1;
} else return mid;
}
return -1;
}