思路:二分查找
class Solution {
public:
int peakIndexInMountainArray(vector<int>& A) {
int low =0;
int high = A.size()-1;
while(low<=high){
int middle = (low+high)/2;
if(A[middle]>=A[middle-1]&&A[middle]>=A[middle+1]){
return middle;
}
else if(A[middle]>=A[middle-1]){
low = middle+1;
}
else if(A[middle]>=A[middle+1]){
high = middle-1;
}
}
return 0;
}
};