Find Peak Element
来源:互联网 发布:视频无损分割软件 编辑:程序博客网 时间:2024/05/16 00:56
A peak element is an element that is greater than its neighbors.
Given an input array where num[i] ≠ num[i+1]
, find a peak element and return its index.
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that num[-1] = num[n] = -∞
.
For example, in array [1, 2, 3, 1]
, 3 is a peak element and your function should return the index number 2.
click to show spoilers.
Note:
解题技巧:Your solution should be in logarithmic complexity.
该题是在一个相邻元素不相等的数组,找出其中的一个局部最大值,返回其对应下标,要求时间复杂度为O(lgN)。因此,可以采用二分查找法,即:如
果中间元素大于其相邻后续元素,则中间元素左侧(包含该中间元素)必包含一个局部最大值。如果中间元素小于其相邻后续元素,则中间元素右侧必
包含一个局部最大值。
代码:
#include <iostream>#include <vector>using namespace std;int findPeakElement(const vector<int> &num){ int left=0,right=num.size()-1; while(left <= right) { if(left == right) return left; int mid = (left + right) / 2; if(num[mid] < num[mid+1]) left = mid+1; else right = mid; }}int main(){ vector<int> num; int x; while(cin >> x) { num.push_back(x); } cout<<findPeakElement(num);}
0 0
- [LeetCode] Find Peak Element
- Find Peak Element
- Leetcode:Find Peak Element
- Find Peak Element
- Find Peak Element
- Find Peak Element
- LeetCode Find Peak Element
- leetcode: Find Peak Element
- leetcode:Find Peak Element
- Find Peak Element
- Find Peak Element
- Find Peak Element
- LeetCode Find Peak Element
- Find Peak Element --leetcode
- Leetcode Find Peak Element
- [LeetCode] Find Peak Element
- Find Peak Element [Medium]
- Leetcode Find Peak Element
- 初入qualcomm平台usb驱动(一)
- 从菜鸟到架构师(二十三)
- Http Token
- RocketMQ集群压测实战一:扩展JMeter
- 三.设计模式-代理模式
- Find Peak Element
- 手机卫士day13
- 2017中国大数据应用大会:“大数据、大智能”
- perl 安装Rex
- iis7 设置自定义错误页没有生效的解决方法
- view的三种测量模式的理解
- 二维指针的几个常见写法的区别,与空间的动态开辟讲解
- excel如何跨表复制数据
- 散列存储(链表法)