本文介绍了一种在给定数组中寻找峰元素（大于相邻元素的元素）的方法，并返回该元素的索引。解决方案在复杂度上采用对数级，确保效率。
A peak element is an element that is greater than its neighbors.
Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that num[-1] = num[n] = -∞.
For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.
Note:
Your solution should be in logarithmic complexity.
{优快云:CODE:635813}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
