class Solution {
public:
int findMin(vector<int>& nums) {
int left = 0, right = nums.size() - 1;
while (left < right) {
int mid = (right - left) / 2 + left;
if (nums[right] < nums[mid]) left = mid + 1;
else right = mid;
}
return nums[right];
}
};
前面一堆0,后面一堆1,然后寻找第一个1的二分问题