153.Find Minimum in Rotated Sorted Array [LeetCode Java实现]

题目链接：find-minimum-in-rotated-sorted-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.
 *
 */

public class FindMinimumInRotatedSortedArray {

//	146 / 146 test cases passed.
//	Status: Accepted
//	Runtime: 247 ms
//	Submitted: 18 minutes ago

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

	public static void main(String[] args) {
		System.out.println(findMin(new int[]{4, 5, 6, 7, 8,  1, 2, 3}));

	}

}