解题思路与33题类似。class Solution { public int findMin(int[] nums) { int l 0, r nums.length - 1; if (nums.length 1) return nums[0]; if (nums[0] nums[r]) return nums[0]; while (l r) { int mid l (r - l) / 2; if (nums[0] nums[mid]) { r mid - 1; } else { l mid 1; } } return nums[l]; } }