题解 | 求峰谷点数

#include<bits/stdc++.h>
using namespace std;
class Solution{
    public:
int countPeakPoint(vector<int>& a){
    int count=0;
    if(a.size()<3){return 0;}
    for(int i=1;i<a.size()-1;i++){
        if(a[i-1]<a[i] && a[i]>a[i+1]){
        count++;
    } else if(a[i-1]>a[i] && a[i]<a[i+1]) count++;
    }
    return count;
}
};