81. Search in Rotated Sorted Array II

Posted 2020-10-08 鸵鸟

class Solution {
    public boolean search(int[] nums, int target) {
        if(nums.length==0)
            return false;
        int lo=0;
        int hi=nums.length-1;
        while(lo<hi)
        {
            int mid=(lo+hi)/2;
            if(nums[mid]==target)
                return true;
            if(nums[mid]>nums[hi])
            {
                if(nums[lo]<=target&&target<nums[mid])
                    hi=mid;
                else
                    lo=mid+1;
            }
            else if(nums[mid]<nums[hi])
            {
                if(nums[mid]<target&&target<=nums[hi])
                    lo=mid+1;
                else
                    hi=mid;
            }
            else
                hi--;
        }
        return nums[lo]==target;
    }
}