class Solution {
public:
int findMin(vector<int>& nums) {
int l = 0;
int r = nums.size() - 1;
while(l < r){
int mid = l + (r - l) / 2;
if(nums[mid] < nums[r]){
r = mid;
}else{
l = mid + 1;
}
}
return nums[l];
}
};
LeetCode 153. 寻找旋转排序数组中的最小值
最新推荐文章于 2024-09-06 10:38:06 发布