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

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

Find the minimum element.

You may assume no duplicate exists in the array.

class Solution {
    public int findMin(int[] nums) {
        if (nums == null || nums.length == 0) return 0;
        if (nums.length == 1) return nums[0];

        int start = 0, end = nums.length - 1;
        while (start + 1 < end){
            int mid = start + (end - start) / 2;

            if (nums[mid] < nums[mid - 1]) return nums[mid];

            if (nums[mid] > nums[start] && nums[mid] > nums[end]){
                start = mid;
            }
            else{
                end = mid;
            }
        }

        return Math.min(nums[start], nums[end]);
    }
}