LeetCode OJ：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.

感觉不太像medium的题目，但是我写的比价乱啊，代码如下：

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

java代码：

public class Solution {
    public int findPeakElement(int[] nums) {
        if(nums.length == 0 || nums.length == 1)
            return 0;
        if(nums[0] > nums[1])
            return 0;
        for(int i = 1; i < nums.length; ++i){
            if(nums[i] > nums[i - 1]){
                if(i+1 >= nums.length || nums[i] > nums[i+1])
                    return i;
            }
        }
        return nums.length - 1;
    }
}