class Solution {
public:
int findMin(vector<int>& nums) {
int low = 0, high = nums.size() - 1;
if(-1 == high) return 0;
if(0 == high || nums[high] > nums[low])
return nums[low];
while(high - low != 1){
int mid = (low + high) / 2;
if(nums[mid] > nums[low]){
low = mid;
}else{
high = mid;
}
}
return nums[high];
}
};
153. Find Minimum in Rotated Sorted Array
最新推荐文章于 2021-07-19 12:53:45 发布