153. Find Minimum in Rotated Sorted Array

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]).

Find the minimum element.

You may assume no duplicate exists in the array.

Example 1:

Input: [3,4,5,1,2]
Output: 1
Example 2:

Input: [4,5,6,7,0,1,2]
Output: 0

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

//前面一堆０，后面一堆１，然后寻找第一个１的二分问题

class Solution {
    public int findMin(int[] nums) {
        int len = nums.length;
        if(len==1) return nums[0];
        int left = 0;
        int right = len -1;
        while(left <= right){
           int mid = (left + right)>>>1;
           if(nums[mid] < nums[right]){
               right = mid -1;
           }else{
               left = mid +1;
           }
        }
        return nums[left];
    }
}

class Solution {
    public int findMin(int[] nums) {
        int len = nums.length;
        if(len==1) return nums[0];
        int left = 0;
        int right = len -1;
        if(nums[right] > nums[0]) return nums[0];
        while(left <= right){
           int mid = (left + right)>>>1;
           if(nums[mid] > nums[mid+1]){
               return nums[mid+1];
           }
           if(nums[mid] < nums[mid-1]){
               return nums[mid];
           }
           if(nums[mid] > nums[0]){
               left = mid +1;
           }else{
               right = mid -1;
           }
        }
        return 0;
    }
}