版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/l718531794/article/details/85109419
题目地址:https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
思路:看复杂度知算法,二分解决。区间要分清就可以了。
AC代码:
class Solution {
public:
int search(vector<int>& nums, int target) {
int n = nums.size();
int l ,r;
l = 0,r = n-1;
int k = 0;
while(l<=r){
int mid = (l+r)/2;
if(nums[mid] == target)
return mid;
if(nums[mid]>=nums[l]){
if(target>=nums[l] && target<nums[mid])
r = mid-1;
else
l = mid+1;
}else if(nums[mid]<=nums[r]){
if(target>nums[mid] && target<=nums[r])
l = mid+1;
else
r= mid-1;
}
}
return -1;
}
};