Leetcode 81. Search in Rotated Sorted Array II

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Search in Rotated Sorted Array II

2. Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class Solution {
public:
bool search(vector<int>& nums, int target) {
int size = nums.size();
int left = 0;
int right = size - 1;
while(left <= right) {
int mid = (left + right) / 2;
if(nums[mid] == target) {
return true;
}
if(nums[left] == nums[mid]) {
left++;
continue;
}
if(nums[left] < nums[mid]) {
if(target >= nums[left] && target <= nums[mid]) {
right = mid - 1;
}
else {
left = mid + 1;
}
}
else {
if(target >= nums[mid] && target <= nums[right]) {
left = mid + 1;
}
else {
right = mid - 1;
}
}
}
return false;
}
};

Reference

  1. https://leetcode.com/problems/search-in-rotated-sorted-array-ii/description/
如果有收获,可以请我喝杯咖啡!