LeetCode: Find Peak Element
来源:互联网 发布:tcpip网络层协议有哪些 编辑:程序博客网 时间:2024/05/21 09:32
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.
class Solution {public: int findPeakElement(const vector<int> &num) { int l = 0, r = num.size()-1; int result = 0; while(l <= r) { int mid = (l + r) / 2; if(mid == l) { result = num[l] > num[r] ? l : r; break; } if(num[mid-1] < num[mid] && num[mid+1] < num[mid]) { result = mid; break; } else if(num[mid-1] > num[mid]) { r = mid-1; } else if(num[mid+1] > num[mid]) l = mid+1; } return result; }};
0 0
- [LeetCode] Find Peak Element
- Leetcode:Find Peak Element
- LeetCode Find Peak Element
- leetcode: Find Peak Element
- leetcode:Find Peak Element
- LeetCode Find Peak Element
- Find Peak Element --leetcode
- Leetcode Find Peak Element
- [LeetCode] Find Peak Element
- Leetcode Find Peak Element
- Leetcode: Find Peak Element
- 【leetcode】Find Peak Element
- leetcode:Find Peak Element
- 【Leetcode】Find Peak Element
- LeetCode:Find Peak Element
- LeetCode:Find Peak Element
- [LeetCode] Find Peak Element
- LeetCode Find Peak Element
- Android中pendingIntent的举例
- 安卓基础(十三)
- C# 遍历treeview
- sql server 获取当前时间
- 一带一路倒逼中国外交决策改革
- LeetCode: Find Peak Element
- (4.1.9)gallery
- 知乎:如何评价2010年柴静采访丁仲礼的视频?
- CentOS 6.4下编译安装MySQL 5.6
- app 手机网页一些小知识
- HDU 4499 Cannon
- 操作系统之内存管理2
- LeetCode Maximum Subarray
- viewpager和fragment结合实现碎片切换,改变字体颜色