81 Search in Rotated Sorted Array II

1 题目

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

2 尝试解

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

3 标准解

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

            // the only difference from the first one, trickly case, just updat left and right
            if( (nums[left] == nums[mid]) && (nums[right] == nums[mid]) ) {++left; --right;}

            else if(nums[left] <= nums[mid])
            {
                if( (nums[left]<=target) && (nums[mid] > target) ) right = mid-1;
                else left = mid + 1; 
            }
            else
            {
                if((nums[mid] < target) &&  (nums[right] >= target) ) left = mid+1;
                else right = mid-1;
            }
        }
        return false;
    }
};