原题链接:Leetcode 2951. 找出峰值
class Solution {
public:
vector<int> findPeaks(vector<int>& mountain) {
vector<int> res;
int n = mountain.size();
for (int i = 1; i < n - 1; i++) {
if (i - 1 >= 0 && i + 1 < n && mountain[i] > mountain[i - 1] &&
mountain[i] > mountain[i + 1]) {
res.push_back(i);
}
}
return res;
}
};