Find Minimum Array

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.

解题思路：二分法，如果中间值大于最右边的值，说明pivot在右，left= mid+1；注意这里要用mid+1，否则test case [2,1]出现死循环，因为不断的令left=mid。

如果pivot不在右边，那么令right=mid。这里不需要right=mid-1，因为除非left== right（而while循环条件已经排除了这种可能），right不可能等于mid。

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

modified: while循环加入条件num[left] > num[right]这样我们就确定在搜寻一个pivot在其中的array。否则是一个正常排序array，只需要return left值

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