该博客介绍了如何解决LeetCode中的162题——寻找峰值，即找到数组中大于其邻居的元素的索引。提供了一个使用log(n)时间复杂度的JAVA解题方案，通过二分查找方法在给定数组中找到峰值元素的索引。文章包括题目描述、解题思路和代码实现，并展示了执行时间和内存消耗。
【LeetCode】162. Find Peak Element 寻找峰值(Medium)(JAVA)
题目描述：
A peak element is an element that is greater than its neighbors.
Given an input array nums, where nums[i] ≠ nums[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 nums[-1] = nums[n] = -∞.
Example 1:
Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.
Example 2:
Input: nums = [1,2,1,3,5,6,4]
Output: 1 or 5
Explanation: Your function can return either index number 1 where the peak element is 2,
or index number 5 where the peak element is 6.
Follow up: Your solution should be in logarithmic complexity.
题目大意
峰值元素是指其值大于左右相邻值的元素。
给
最低0.47元/天 解锁文章
633
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
