【Leetcode】Array | 81. 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){
        if(nums.empty()) return false;       // case 1 不为空
        if(nums.size() == 1)                // 只有一个数字
            return nums[0] == target;
        int mark = 1;
        while(mark < nums.size()){          // 找到分解点
            if(nums[mark - 1] > nums[mark])
                break;
            mark++;
        }
        return (binary_search(nums.begin(),nums.begin()+mark,target) ||
                binary_search(nums.begin() + mark,nums.end(),target)); // 二分法查找
    }
};