153. Find Minimum in Rotated Sorted Array java solutions

Suppose a sorted array 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.

Subscribe to see which companies asked this question

public class Solution {
    public int findMin(int[] nums) {
        if(nums == null) return 0;
        int low = 0,high = nums.length-1;
        if(nums[low] <= nums[high]) return nums[0];
        int mid = 0;
        while(low < high){
            mid = (low + high)/2;
            if(nums[mid] > nums[mid+1]) return nums[mid+1];// 后面的数字比前面小，就可以找到了。
            if(nums[mid] > nums[low]) low = mid;
            else high = mid;
        }
        return nums[0];
    }
}

这里用二分做的时候，经常分不清楚情况。