class Solution {
public:
int findMin(vector<int> &nums) {
int l=0, r=nums.size()-1;
while(l<r){
int mid = l+(r-l)/2;
if(nums[mid]>nums[r]) l=mid+1;
else if(nums[mid]<nums[r]) r=mid;
else r--;
}
return nums[r];
}
};
LintCode - Find Minimum in Rotated Sort Array II
猜你喜欢
转载自blog.csdn.net/real_lisa/article/details/84200435
今日推荐
周排行