153. Find Minimum in Rotated Sorted Array

    public static int findMin(int[] nums) {        if(nums == null || nums.length == 0) {            return 0;        }else if(nums.length == 1) {            return nums[0];        }        int min = nums[0];        int i = 0;        for(i = 1; i < nums.length; i++) {            if(nums[i] < nums[i-1] && nums[i] < min) {                min = nums[i];            }        }        return min;    }