【LeetCode】33. Search in Rotated Sorted Array 在旋转数组中搜索

题目

33. Search in Rotated Sorted Array

---

思路

二分
注意二分的边界，我写的提前判断太繁琐了，有点丑

---

代码

class Solution {
public:
    int maxn = 11000;
    int tag[21000];
    int search(vector<int>& nums, int target) {
        int n=nums.size();
        if(n==1)return nums[0]==target?0:-1;
        int l=1,r=n-1,mid;
        while(l<=r){
            mid=(l+r)/2;
            if(nums[mid]<nums[0])r=mid-1;
            else l=mid+1;
        }
        int ll,rr;
        if(l>n-1)ll=0,rr=n-1;
        else{
            if(target>nums[l-1])return -1;
            if(target<nums[l])return -1;
            if(target>nums[n-1]&&target<nums[0])return -1;
            if(target>nums[n-1])ll=0,rr=l-1; 
            else ll=l,rr=n-1;
        }

      
        while(ll<=rr){
            mid=(ll+rr)/2;
            if(nums[mid]==target) return mid;
            if(nums[mid]<target) ll=mid+1;
            else rr=mid-1;
        }
        return -1;
    }
};