153. Find Minimum in Rotated Sorted Array

binary search但是三个数的时候单独处理

    public int findMin(int[] nums) {
        if(nums.length == 0) {
            return 0;
        }   
        int left = 0;
        int right = nums.length - 1;
        while(left < right - 2) {
            if(nums[left] < nums[right]) {
                return nums[left];
            }
            int mid = left + (right - left) / 2;
            if (nums[mid-1] < nums[left]) {
                right = mid - 1;
            } else if (nums[mid+1] > nums[right]){
                left = mid + 1;
            } else {
                left = mid - 1;
                right = mid + 1;
            }
        }
        return Math.min(Math.min(nums[left + (right - left)/2], nums[left]), nums[right]);
    }