[leetcode-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
= -∞.

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.

Credits:

Special thanks to @ts for adding this problem and creating all test cases.

分析：这道题没什么难度，稍微注意点不要数组越界就好。

代码如下：０ｍｓ

[code]int findPeakElement(int* nums, int numsSize) {
    if(numsSize==1 || nums[0]>nums[1])
        return 0;
    if(nums[numsSize-1]>nums[numsSize-2])
        return numsSize-1;

    for(int i = 1;i<numsSize-1;i++){
        int prev = nums[i-1];
        int now = nums[i];
        int next = nums[i+1];
        if(now>prev && now>next)
            return i;
    }
}