162. Find Peak Element

最新推荐文章于 2023-12-17 11:28:18 发布

原创最新推荐文章于 2023-12-17 11:28:18 发布 · 475 阅读

0 ·

CC 4.0 BY-SA版权

*LeetCode 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种寻找峰值元素的方法。峰值元素是指比其邻居大的元素。文章提供了一个C++实现的例子，该例子通过遍历数组来查找峰值元素并返回其索引。

162. Find Peak Element

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.

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int nn = nums.size();
        if(nn==1) return 0;
        for(int i=0; i<nn; i++)
        {
           if(i==0 && nums[i]>nums[i+1]) return i;
           else if(i==nn-1  && nums[i]>nums[i-1]) return i;
           else if(nums[i]>nums[i+1] && nums[i]>nums[i-1]) return i;
        }
    }
};