leetcode162

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int n = nums.size();
        if (n == )
        {
            return ;
        }
        if (nums[] > nums[])
        {
            return ;
        }
        if (nums[n - ] < nums[n - ])
        {
            return n - ;
        }

        for (int i = ; i < nums.size() - ; i++)
        {
            if (nums[i] > nums[i - ] && nums[i] > nums[i + ])
            {
                return i;
            }
        }
    }
};

补充一个python的实现，使用二分查找：

 class Solution:
     def findPeakElement(self, nums: List[int]) -> int:
         l, r = , len(nums) - ;
         while l < r:
             m = l + (r - l) //
             if nums[m] > nums[m + ]:
                 r = m
             elif nums[m] < nums[m + ]:
                 l = m +
         return l