852. 山脉数组的峰顶索引

题目链接:https://leetcode.cn/problems/peak-index-in-a-mountain-array/description/

Java

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public int peakIndexInMountainArray(int[] arr) {
int high = arr.length - 1;
int low = 0;
int mid = 0;
while (low < high) {
mid = low + ((high - low) / 2);
int midVal = arr[mid];
if (midVal > arr[mid-1] && midVal > arr[mid+1]) {
break;
}
if (midVal > arr[mid+1]) {
high = mid;
} else {
low = mid;
}
}
return mid;
}
}

852. 山脉数组的峰顶索引
https://pisces34.github.io/2025/03/28/leetcode/852/
发布于
2025年3月28日
许可协议