class Solution {
public:
int findMin(vector<int>& nums) {
int len=nums.size();
return find(nums,0,len-1);
}
int find(vector<int>&nums,int l,int r )
{
if(l==r)
return nums[l];
int m=(l+r)/2;
if(nums[l]<=nums[m]&&nums[m]<=nums[r])
return nums[l];
if(nums[l]>=nums[m]&&nums[m]>=nums[r])
return nums[r];
if(nums[l]>nums[r]&&nums[m]<nums[r])
return find(nums,l,m);
return find(nums,m,r);
}
};
[leetcode]153. Find Minimum in Rotated Sorted Array
最新推荐文章于 2023-11-12 21:10:53 发布