1 2 3 4 5 6 7 8 9 10 11 12 13 14 class Solution { public int findMin(int[] nums) { int l = 0, r = nums.length - 1; while (l < r) { int m = l + (r - l) / 2; if (nums[m] > nums[r]) { l = m + 1; } else { r = m; } } return nums[l]; } }