153. 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.

Related issue: 154 Find Minimum in Rotated Sorted Array II

public class Solution {
    public int findMin(int[] nums) {
        int l = 0;
        int r = nums.length-1;
        while(l <= r){
            int mid = l + (r-l)/2;
            if(l == r) break;
            if(nums[l] < nums[r]) break;
            if(nums[mid] >= nums[l]){
                l = mid +1;
            }else{
                r = mid;
            }

        }
        return nums[l];
    }
}