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.
Java:
public class Solution {
public int findMin(int[] nums) {
if(nums.length == 0) return -1;
int min = nums[0];
int i=0;
while(i < nums.length -1 && nums[i] < nums[i+1] )
{
i++;
}
if(i== nums.length -1) return min;
return nums[i+1];
}
}