Find Peak Element

<span style= "font-family:arial; Background-color: #ffffff "></span>

A peak element is an element, which is greater than its neighbors.

Given an input array where num[i] ≠ num[i+1] , the find a peak element and return its index.

The array may be contain multiple peaks, in this case return the index to any one of the peaks is fine.

May imagine 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.

C++

int findpeakelement (const vector<int> &num) {for        (int i = 1; i < num.size (); i + +)        {            if (Num[i] &l T NUM[I-1])                return i-1;        }        Return Num.size ()-1;    }

Python

def findpeakelement (self,num):        If Len (num) ==1:            return 0 for        index in range (len (num)):            if index==0:                if Num[index] > num[index+1]:                    return index            elif Num[index] < Num[index-1]:                return index-1< C15/>return len (num)-1

Find Peak Element