
题目传送门:852题
class Solution {
public:
int peakIndexInMountainArray(vector& arr) {
int l = 0, r = arr.size() - 1;
while (l < r) {
int mid = l + r + 1 >> 1;
if (arr[mid] > arr[mid - 1]) l = mid;
else r = mid - 1;
}
return r;
}
};
欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)