LeetCode Find Peak Element
2014-12-08 21:00
337 查看
A peak element is an element that is greater than its neighbors.
Given an input array where
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that
For example, in array
the index number 2.
click to show spoilers.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
题意:找一个任意的凸峰。
思路:模拟凸峰的概念就行了
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 = -∞.
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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
题意:找一个任意的凸峰。
思路:模拟凸峰的概念就行了
class Solution { public: int findPeakElement(const vector<int> &num) { for (int i = 1; i < num.size(); i++) if (num[i-1] > num[i]) return i-1; return num.size() - 1; } };
相关文章推荐
- LeetCode: Find Peak Element
- [LeetCode] Find Peak Element 求数组的峰值
- LeetCode Find Peak Element
- [C语言][LeetCode][162]Find Peak Element
- 【leetcode】Find Peak Element
- leetcode -- Find Peak Element -- 找波峰--重点
- 【leetcode】Find Peak Element
- Leetcode Find Peak Element
- Leetcode_162_Find Peak Element
- LeetCode 162 Find Peak Element
- leetcode[162]Find Peak Element
- leetcode 162 Find Peak Element(二分法)
- leetcode 日经贴,python code -Find Peak Element
- LeetCode162—Find Peak Element
- 刷leetcode:Find Peak Element
- LeetCode OJ Find Peak Element
- (leetcode162)find peak element
- [Leetcode]Find Peak Element
- 【leetcode】Find Peak Element ☆
- LeetCode153 Find Minimum in Rotated Sorted Array. LeetCode162 Find Peak Element