Problem: 2210. 统计数组中峰和谷的数量 Code class Solution {public:int countHillValley(vector<int>& nums) {int cnt = 0;int n = nums.size();for(int i = 1; i < n - 1; i ++) {// if(nums[i] > nums[i + 1] && num