Leetcode Search in Rotated Sorted Array II

最新推荐文章于 2024-10-14 18:52:56 发布

rosepicker

最新推荐文章于 2024-10-14 18:52:56 发布

阅读量183

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/rosepicker/article/details/73484749

版权

leetcode 专栏收录该内容

124 篇文章 0 订阅

订阅专栏

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Write a function to determine if a given target is in the array.

The array may contain duplicates.

代码如下：

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