leetcode刷题笔记(Golang)--162. Find Peak Element

最新推荐文章于 2026-07-07 20:52:09 发布

原创最新推荐文章于 2026-07-07 20:52:09 发布 · 180 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode刷题笔记(Golang)

当前文章被收录于：

leetcode刷题笔记(Golang)

172 篇文章 4 人学习

主要学习的bolg： 1. 花花酱大神 https://zxi.mytechroad.com/blog 2. 负雪明烛 https://blog.csdn.net/fuxuemingzhu

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一种在给定数组中寻找峰值元素的算法，峰值元素定义为大于其邻居的元素。文章提供了一个函数实现，该函数能在对数复杂度内找到峰值元素的索引，即使数组中有多个峰值，返回任意一个峰值的索引都是可以接受的。

162. Find Peak Element

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.
Note:

Your solution should be in logarithmic complexity.

func findPeakElement(nums []int) int {
	lg := len(nums)
	if lg == 1 {
		return 0
	}
	l := 0
	r := lg - 1
	for l < r {
		mid := l + (r-l)/2
		if nums[mid] < nums[mid+1] {
			l = mid+1
		} else {
			r = mid
		}
	}
	return l  
}