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[] nums) {
int res = nums[0];
for (int i = 0; i < nums.length-1; i++) {
if (nums[i] > nums[i+1]) {
res = nums[i+1];
break;
}
}
return res;
}
}

### Like this:

Like Loading...

*Related*