寻找旋转排序数组中的最小值

public class Solution {
    /**
     * @param nums: a rotated sorted array
     * @return: the minimum number in the array
     */
    public int findMin(int[] nums) {
        int i = nums[0];
        for(int j = 1; j < nums.length; j++ ) {
            if(nums[j] < i)
                i = nums[j];
        }
        return i;
    }
}

public class Solution {
    /**
     * @param nums: a rotated sorted array
     * @return: the minimum number in the array
     */
    public int findMin(int[] nums) {
        int l = 0;
        int r = nums.length-1;
        if (nums[l] < nums[r])  
            return nums[l];
        
        while (l < r) {
            int mid = (l + r) / 2;
            if (nums[mid] > nums[r])
                l = mid + 1;
            else
                r = mid;
        }
        
        return nums[r];
    }
}