总结在Rotate Sorted Array中的问题

#33. Search in Rotated Sorted Array

这道题用二法来确定。可以根据比较中间值和最右边值的大小看出旋转点是在左边还是右边，再进一步确定target的位置。

Example 1:
Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:
Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

var search = function(nums, target) {
    let left=0;
    let right = nums.length-1;
    while(left<=right) {
        let mid = Math.floor((left+right)/2);
        if(nums[mid]===target) {
            return mid;
        }
        if(nums[mid]<nums[right]) {
            if(nums[mid]<target && nums[right]>=target) {
                left=mid+1;
            }
            else {
                right=mid-1;
            }
        } 
        else{
            if(nums[left]<=target && nums[mid]>target) {
                right=mid-1;
            }
            else {
                left=mid+1;
            }
        }
    }
    return -1;
};

#81. Search in Rotated Sorted Array II

这道题和上面不同之处在于，允许数组中有重复的数

var search = function(nums, target) {
    let left=0;
    let right=nums.length-1;
    while(left<=right) {
        let mid = Math.floor((left+right)/2);
        if(nums[mid]==target) {
            return true;
        }
        if(nums[mid]<nums[right]) {
            if(nums[mid]<target && nums[right]>=target) {
                left=mid+1;
            }
            else {
                right=mid-1;
            }
        }
        else if(nums[mid]>nums[right]) {
            if(nums[left]<=target && nums[mid]>target) {
                right=mid-1;
            }
            else {
                left=mid+1;
            }
        }
        else {
            --right;
        }
    }
    return false;
};

#153. Find Minimum in Rotated Sorted Array

var findMin = function(nums) {
    let left=0;
    let right=nums.length-1;
    while(left<right) {
        let mid = Math.floor((left+right)/2);
        if(nums[mid]>nums[right]) {
            left=mid+1;
        }
        else {
            right=mid;
        }
    }
    return nums[right]
}

#154. Find Minimum in Rotated Sorted Array II

var findMin = function(nums) {
    let left=0;
    let right=nums.length-1;
    while(left<right) {
        let mid = Math.floor((left+right)/2);
        if(nums[mid]>nums[right]) {
            left=mid+1;
        }
        else if(nums[mid]<nums[right]) {
            right=mid;
        }
        else {
            --right;
        }
    }
    return nums[right];
};