【leetcode】Find Peak Element
2015-01-26 23:21
579 查看
Find Peak Element
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 = -∞.
For example, in array
[1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.
Note:
Your solution should be in logarithmic complexity.
利用二分法才能达到logarithmic的复杂度
当num[mid]<num[mid+1]时,peek一定在右边
当num[mid]>num[mid+1]时,peek一定在左边
class Solution { public: int findPeakElement(const vector<int> &num) { int n=num.size(); int left=0; int right=n-1; int result; int mid; while(left<right) { mid=(left+right)/2; if(mid+1>n-1) { return mid; } if(num[mid]<num[mid+1]) { left=mid+1; } else if(num[mid]>num[mid+1]) { right=mid; } } return left; } };
相关文章推荐
- 【LeetCode】(162)Find Peak Element(Medium)
- LeetCode[162] Find Peak Element
- [LeetCode]Find Peak Element
- [leetcode]Find Peak Element
- !leetcode[162]:Find Peak Element
- leetcode_c++:Find Peak Element(162)
- 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 162, Medium] Find Peak Element
- LeetCode[Array]: Find Peak Element
- Leetcode Find Peak Element
- leetcode-二分查找:Find Peak Element
- [leetcode-162]Find Peak Element(c)
- LeetCode: Find Peak Element
- LeetCode Find Peak Element
- [C语言][LeetCode][162]Find Peak Element