#include using namespace std; class Solution { public: vector findPeaks(vector& mountain) { vectorrlt; const int len = mountain.size(); for(int i = 1 ; i < mountain.size() - 1; i++){ if(mountain[i] > mountain[i-1] && mountain[i] > mountain[i+1]) rlt.push_back(i); } return rlt; } }; int main(){ Solution sol; vector ex1 = {2,4,4}; vectorrlt1 = sol.findPeaks(ex1); for(int i = 0 ; i ex2 = {1,4,3,8,5}; vectorrlt2 = sol.findPeaks(ex2); for(int i = 0 ; i