## 题目地址

https://leetcode.com/problems/search-in-rotated-sorted-array-ii/

## 题目描述

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

``````

Follow up:

• This is a follow up problem to Search in Rotated Sorted Array, where `nums` may contain duplicates.
• Would this affect the run-time complexity? How and why?

## 代码

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

评论
0 评论