版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://cloud.tencent.com/developer/article/1435027
文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
class Solution {
public:
int peakIndexInMountainArray(vector<int>& A) {
int left = 0;
int right = A.size() - 1;
while(left < right) {
int mid = (left + right) / 2;
if(A[mid] > A[mid + 1]) {
right = mid;
}
else {
left = mid + 1;
}
}
return left;
}
};