leetcode_search_in_rotated_sorted_array_ii

发表于

难度：Medium

解题思路：是系列1的延伸。遇到[1,1,5,1] [5,1,1]这种我们无法判断哪部分是有序的。处理方式是，最右边的向左移动一位，直到移到不同值。

代码如下：

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

运行结果：6ms，超过31.56%