''' public class Solution {

public int findMin(int[] nums) {

if (nums==null || nums.length<=0) {

return -1;

}

int start = 0;

for(int i=0;i<nums.length-1;i++){

if (nums[i+1]<nums[i]) {

start = i+1;

break;

}

}

return Math.min(nums[start], nums[0]);

}

}'''