leetcode 2951.找出峰值

思路：模拟就行了

class Solution {
public:
    vector<int> findPeaks(vector<int>& mountain) {
        vector<int>res;
        for(int i=1;i<mountain.size()-1;i++){
            if(mountain[i-1]<mountain[i]&&mountain[i]>mountain[i+1])
            res.push_back(i);
        }
        return res;
    }
};