class Solution {
/**
* @param A: An integers array.
* @return: return any of peek positions.
*/
public int findPeak(int[] A) {
// 2015-4-12
if (A == null || A.length <= 2) {
return -1;
}
int start = 0;
int end = A.length - 1;
while (start + 1 < end) {
int mid = (start + end) / 2;
if (A[mid - 1] > A[mid]) {
end = mid;
} else if (A[mid] < A[mid + 1]) {
start = mid;
} else {
return mid;
}
} // while 肯定能找到
return -1;
}
}
[刷题]Find Peak Element
最新推荐文章于 2023-03-17 09:19:14 发布