# lintcode:Find Peak Element

287人阅读 评论(0)

There is an integer array which has the following features:

• The numbers in adjacent positions are different.
• A[0] < A[1] && A[A.length - 2] > A[A.length - 1].

We define a position P is a peek if:

A[P] > A[P-1] && A[P] > A[P+1]

Find a peak element in this array. Return the index of the peak.

Example
Given [1, 2, 1, 3, 4, 5, 7, 6]

Return index 1 (which is number 2) or 6 (which is number 7)

Note
The array may contains multiple peeks, find any of them.

Challenge
Time complexity O(logN)

class Solution {
public:
/**
* @param A: An integers array.
* @return: return any of peek positions.
*/
int findPeak(vector<int> A) {
int l=0,r=A.size()-1;
//l,r-1,r是循环的最小情况
while(l<r-1){
int mid=l+(r-l)/2;
if(A[mid]>A[mid-1]&&A[mid]>A[mid+1]){
return mid;
}else if(A[mid]<A[mid-1]){
r=mid;
}else if(A[mid]<A[mid+1]){
l=mid;
}
}
}
};
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：396672次
• 积分：8053
• 等级：
• 排名：第2632名
• 原创：390篇
• 转载：276篇
• 译文：0篇
• 评论：27条
联系方式
E-mail：gwh_mail@qq.com QQ：1440156051
评论排行
最新评论