image.png
https://algorithm.yuanbin.me/zh-hans/binary_search/find_peak_element.html
image.png
class Solution {
public:
int findPeakElement(vector<int>& nums) {
int l = 0;
int r = nums.size() - 1;
while(l + 1 < r){
int mid = l + (r - l) / 2;
if(nums[mid] < nums[mid - 1]) r = mid;
else l = mid;
}
int res = nums[l] < nums[r] ? r : l;
return res;
}
};
LeetCode 162. Find Peak Element Description A peak elemen...
lt75 Find Peak Elementlt390 Find Peak Element IIlt141 Sqr...
162. Find Peak Element https://leetcode.com/problems/find...
https://algorithm.yuanbin.me/zh-hans/binary_search/find_p...
Question from lintcodeThere is an integer array which has...
A peak element is an element that is greater than its nei...
===================== 解題思路 ===================== 二分法直到找出 ...
Find Peak Element本质上都是half half 以下是leetcode的版本，leetcode允许...
https://leetcode.com/problems/find-peak-element/ 给定一个无序数组...
相关阅读： 微信平台：153. Find Minimum in Rotated Sorted Array 简书：1...
本文标题：Find Peak Element(!!!)
本文链接：https://www.haomeiwen.com/subject/aeosiftx.html
网友评论