[C语言][LeetCode][162]Find Peak Element

题目

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.

标签

Array、Binary Search

难度

中等

分析

题目意思是给定一个相邻元素不相等的整形数组，找到一个峰值数字（比两边的元素要大），并返回index。
解题思路是遍历数组，只要找到一个数字比下一个数字大的，则返回index即可。

C代码实现

int findPeakElement(int* nums, int numsSize) {    int i=0;    while((i+1)< numsSize)    {        if(nums[i] > nums[i+1])            return i;        i++;    }    return i; }