leetcode-Find Peak Element-162

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