33 在旋转有序数组中搜索 Search in Rotated Sorted Array

最新推荐文章于 2022-07-08 14:58:46 发布

qq_33311057

最新推荐文章于 2022-07-08 14:58:46 发布

阅读量113

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_33311057/article/details/81610497

版权

LeetCode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int search(vector<int>& nums, int target) {
        if(nums.empty()) return -1;
        int left = 0,right = nums.size()-1;
        while(left<=right)
        {  
            int mid = (left + right) / 2;
            if (target == nums[mid]) return mid;
            else if(nums[mid]<nums[right])
            {               
                if(target>nums[mid]&&target<=nums[right]) left = mid+1;
                else right = mid-1;
            }
            else
            {
                if(target>=nums[left]&&target<nums[mid]) right = mid-1;
                else left = mid+1;
            }   
        }
        return -1;    
    }
};