题目:
升序排列的整数数组 nums
在预先未知的某个点上进行了旋转(例如, [0,1,2,4,5,6,7]
经旋转后可能变为 [4,5,6,7,0,1,2]
)。请你在数组中搜索 target
,如果数组中存在这个目标值,则返回它的索引,否则返回 -1
。(https://leetcode-cn.com/problems/search-in-rotated-sorted-array/)
示例
1、输入:nums = [4,5,6,7,0,1,2], target = 0 输出:4
2、输入:nums = [4,5,6,7,0,1,2], target = 3 输出:-1
提示:
- 1 <= nums.length <= 5000
- -10^4 <= nums[i] <= 10^4
- nums 中的每个值都 独一无二
- nums 肯定会在某个点上旋转
- -10^4 <= target <= 10^4
方案:二分法
class Solution {
public:
int search(vector<int>& nums, int target) {
if (nums.empty()) {
return -1;
}
if (nums.size() == 1) {
return nums[0] == target ? 0 : -1;
}
int l = 0, r = nums.size() - 1;
while (l <= r) {
int mid = (l + r) >> 1;
if (nums[mid] == target) {
return mid;
}
if (nums[mid] < nums[r]) {
if (target > nums[mid] && target <= nums[r]) {
l = mid + 1;
} else {
r = mid - 1;
}
} else {
if (target >= nums[l] && target < nums[mid]) {
r = mid - 1;
} else {
l = mid + 1;
}
}
}
if (l > r) {
return -1;
} else {
return l;
}
}
};
时间复杂度
空间复杂度
注意:旋转右侧所有元素小于nums[0]