162. Find Peak Element

最新推荐文章于 2025-05-20 17:29:58 发布

原创最新推荐文章于 2025-05-20 17:29:58 发布 · 423 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

28 篇文章

订阅专栏

Array

22 篇文章

订阅专栏

本文介绍了一个简单的方法来查找数组中的峰值元素及其索引。峰值元素是指大于其相邻元素的元素。文章提供了一段C++代码实现，该算法的时间复杂度为O(n)。

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.

click to show spoilers.

思想：很简单的一个逻辑题，注意一下边界的判断就好了

C++ AC代码：时间o(n)

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int len = nums.size();
        for(int i=0;i<len;i++){
            //简单的逻辑判断，注意下边界
            if((i==0&&nums[i]>nums[i+1])||(i+1==len&&nums[i]>nums[i-1])||(nums[i]>nums[i-1]&&nums[i]>nums[i+1]))
                return i;
        }
        return 0;
    }
};