class Solution {
public:int findMin(vector<int>& nums) {int l = 0, r = nums.size() - 1;int min = 10000;while (l <= r) {int mid = l + (r - l) / 2;if (min > nums[mid]) {min = nums[mid];}if (nums[l] == nums[mid]) {l++;} else if (nums[mid] <= nums[r]) {r = mid - 1;} else {l = mid + 1;}}return min;}
};
与81题思路类似