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