public int findMin(int[] nums) {
int start = 0, end = nums.length - 1, mid = 0;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (nums[mid] > nums[end]) {
else if (nums[mid] < nums[end]) {
return nums[start] < nums[end] ? nums[start] : nums[end];