LeetCode 81和33

原题:

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Write a function to determine if a given target is in the array.

The array may contain duplicates

题意：一个升序数组，数字可能有重复，要求从中找一个数字返回true or false

代码和思路：

class Solution {
    public boolean search(int[] nums, int target) {
        int start = 0 , end = nums.length-1;
        
        //二分法查找
        while(start<=end){
            int mid = (start+end)/2;
            if(nums[mid]==target){
                return true;
            }
            //以mid为界,左无序，右有序
            if(nums[start]>nums[mid] || nums[mid]<nums[end]){
                if(target>nums[mid] && target<=nums[end]){
                    start = mid+1;
                }
                else{
                    end = mid-1;
                }
            }
            //以mid为界,右无序，左有序
            else if(nums[start]<nums[mid] || nums[mid]>nums[end]){
                if(target>=nums[start] && target<nums[mid]){
                    end = mid-1;
                }
                else{
                    start = mid+1;
                }
            }
            //这里说明，start  mid end 都是相等的，用start++ 或 end--
            else{
                start++;
            }
        }
        return false;
    }
}

下面是33题的代码：区别是33题数字不能重复     所以81题不能简单的用nums[mid]>=nums[lo]来判断左边是有序的，例如{2,3,2,2,2,2}

条件要分解成

nums[lo] < nums[mid] 左区间有序

nums[lo] == nums[mid]  那么 lo mid 区间不能确定， 那么lo++再来判断

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