跳转至

搜索旋转排序数组 II'⚓︎

Leetcode题目链接

描述⚓︎

详见中文题目链接。

解答⚓︎

 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
class Solution {
public:
    bool search(vector<int>& nums, int target) {
        int R = nums.size() - 1;
        while (R && nums[R] == nums[0]) R--;
        if (R < 0) return nums[0] == target;

        int l = -1, r = R + 1;
        while (l + 1 < r) {
            int mid = l + r >> 1;
            if (nums[mid] >= nums[0]) l = mid;
            else r = mid;
        }

        if (target >= nums[0]) r = l + 1, l = -1;
        else r = nums.size();

        while (l + 1 < r) {
            int mid = l + r >> 1;
            if (nums[mid] >= target) r = mid;
            else l = mid;
        }
        if (r < nums.size() && nums[r] == target) return true;
        return false;
    }
};