No.134 - LeetCode162

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