3349. 检测相邻递增子数组 I

3349. 检测相邻递增子数组 I

---

题目链接：3349. 检测相邻递增子数组 I

代码如下：

class Solution {
public:bool hasIncreasingSubarrays(vector<int>& nums, int k) {int n = nums.size(), cnt = 1, maeCnt = 1;for (int i = 1;i < n;i++) {if (i == n - 1 || nums[i-1] >= nums[i]) {if (nums[i - 1] < nums[i]) {cnt++;}if ((maeCnt >= k && cnt >= k) || cnt >= 2 * k) {return true;}maeCnt = cnt;cnt = 1;}else {cnt++;}}return false;}
};