leetcode 随笔 Search in Rotated Sorted Array II

最新推荐文章于 2021-12-18 23:10:30 发布

Runner_of_nku

最新推荐文章于 2021-12-18 23:10:30 发布

阅读量1.2w

点赞数

分类专栏： note

本文链接：https://blog.csdn.net/Runner_of_nku/article/details/80180191

版权

note 专栏收录该内容

57 篇文章 2 订阅

订阅专栏

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

(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).

You are given a target value to search. If found in the array return true, otherwise return false.

Example 1:

Input: nums = [2,5,6,0,0,1,2], target = 0
Output: true

Example 2:

Input: nums = [2,5,6,0,0,1,2], target = 3
Output: false

还是一个二分查找的问题，比起之前Search in Rotated Sorted Array这题，主要是多了左右相等的情况。

class Solution {
public:
    bool search(vector<int>& nums, int target) {
        if(nums.empty()) return false;
        int n=nums.size(),l=0,r=nums.size()-1,m=(r+l)/2;
        while(r>=l)
        {
            m=(l+r)/2;
            if(nums[m]==target) return true;
            if(nums[l]==nums[r])
            {
                if(nums[l]==target) return true;
                l++;
                r--;
                continue;
            }
            if(nums[r]>=nums[m])
            {
                if(target>nums[m]&&target<=nums[r])
                {
                    l=m+1;
                }
                else
                {
                    r=m-1;
                }
            }
            else
            {
                if(target>=nums[l]&&target<nums[m])
                {
                    r=m-1;
                }
                else
                {
                    l=m+1;
                }
            }
        }
        return false;
    }
};