leetcode 194 — find-peak-element

pks_

·

Follow

Jun 20, 2021

--

Listen

Share

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