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 Solution { public int findMin(int[] num) { Arrays.sort(num); return num[0]; } }
Find Minimum in Rotated Sorted Array
原文：http://www.cnblogs.com/mrpod2g/p/4343118.html