81. Search in Rotated Sorted Array II

最新推荐文章于 2023-11-12 22:36:10 发布

原创最新推荐文章于 2023-11-12 22:36:10 发布 · 147 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

22 篇文章

订阅专栏

本文介绍了一种在未知旋转点的升序数组中查找特定目标值的方法。该数组可能包含重复元素，采用一种高效的搜索策略实现这一目标。通过一个C++函数示例展示了具体的实现细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        if(nums.size() == 0) return false;
        int low = 0, high = nums.size()-1;
        while(low<=high){
            int mid = low + (high-low)/2;
            if(nums[mid] == target) return true;
            if(nums[mid] > nums[low]){
                if(target < nums[mid] && target >= nums[low]){
                    high = mid - 1;
                }else{
                    low = mid + 1;
                }
            }else if(nums[mid] < nums[low]){
                if(target > nums[mid] && target <= nums[high]){
                    low = mid + 1;
                }else{
                    high = mid - 1;
                }
            }else{
                low++;
            }
        }
        return false;
    }
};