Find Peak Element

 1 class Solution {
 2 public:
 3     int findPeakElement(vector<int>& nums) {
 4         int size=nums.size();
 5         if(size==1)
 6             return 0;
 7         if(nums[0]>nums[1])
 8             return 0;
 9         if(nums[size-1]>nums[size-2])
10             return size-1;
11         for(int i=1;i<size-1;i++)
12         {
13             if(nums[i]>nums[i-1]&&nums[i]>nums[i+1])
14                 return i;
15         }
16     }
17 };