## 知之可否

Be yourself; everyone else is already taken.​

# lintcode:Find Peak Element

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) {
// write your code here
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;
}
}
}
};

06-21 1425

12-17 6348

12-15 1.1万

12-07 4284

01-01 2177

02-07 28

08-03 486

03-16 177

06-14 300

01-08 803