题目介绍

题解

题源：
153.寻找旋转排序数组中的最小值
在此基础上，进行二分之前，单独处理一下左指针和最后一个数相同的情况就好了。

java">class Solution {public int findMin(int[] nums) {int left = 0, right = nums.length - 2; while(left <= right && nums[left] == nums[nums.length - 1]){left++;}while (left <= right) { int mid = left + (right - left) / 2;if (nums[mid] <= nums[nums.length - 1]) {right = mid - 1; } else {left = mid + 1;               }}return nums[left];}
}