int findPeakElement(vector<int>& nums) {
// write code here
int left = 0, right = nums.size() - 1;
while(left < right)
{
int mid = (right - left) / 2 + left;
if(nums[mid] < nums[mid + 1])
left = mid + 1;
else
right = mid;
}
return left;
}
刷题——寻找峰值
最新推荐文章于 2024-08-01 15:05:06 发布