和之前二分查找的思路有点像注意right nums.length - 1class Solution { public int findMin(int[] nums) { int left -1; int right nums.length - 1; while(left 1 right){ int mid left (right - left) / 2; if(nums[mid] nums[nums.length - 1]){ right mid; }else{ left mid; } } return nums[right]; } }