find minimum in rotated sorted array

public static int findMin(int[] nums){
    if (nums == null || nums.length == 0){
        return 0;
    }
    if (nums.length == 1){
        return nums[0];
    }
    return findMin(nums, 0, nums.length - 1);
}

public static int findMin(int[] nums, int left, int right){
    if (nums[left] < nums[right]){
        return nums[left];
    }
    if (left == right){
        return nums[left];
    }
    if (left + 1 == right){
        return Math.min(nums[left], nums[right]);
    }

    int mid = (left + right) / 2;

    //solution1和solution2任选一个
    //solution1
    if (nums[mid] > nums[left]){
        return findMin(nums, mid+1, right);
    }else{
        return findMin(nums, left, mid);
    }

    //solution2
    //return Math.min(findMin(nums, left, mid), findMin(nums, mid+1, right));
}

public static int findMin(int[] nums){
    if (nums == null || nums.length == 0){
        return 0;
    }
    int l = 0, r = nums.length - 1;

    while (l <= r){
        if (nums[l] <= nums[r]){
            return nums[l];
        }

        int m = (i + j) / 2;
        if (nums[m] >= nums[i]){
            l = m + 1;
        }else{
            r = m;
        }
    }
    return nums[l];
}