leetcode每日一题 P3349 检测相邻递增子数组 I

---

时间轴

时间轴

2025-10-14

init

数组

---

题目：

P3349 检测相邻递增子数组 I

https://leetcode.cn/problems/adjacent-increasing-subarrays-detection-i/description/?envType=daily-question&envId=2025-10-14

用两个指针分别比对即可，如果在某处不匹配，那么直接把指针移向这个位置重新开始匹配。

#include <vector>
using std::vector;

class Solution {
public:
  bool hasIncreasingSubarrays(vector<int> &nums, int k) {
    int i;
    int a = 0, b = k;
    int n = nums.size();

 loop:
    while (b + k - 1 < n) {
      for (i = 1; i < k; i++) {
        if (nums[a + i] > nums[a + i - 1] && nums[b + i] > nums[b + i - 1]) {
          continue;
        } else {
          a += i;
          b = a + k;
          goto loop;
        }
      }
      return true;
    }
    return false;
  }
};

#include <stdio.h>
int main() {
  Solution s;
  vector<int> vec = {2, 5, 7, 8, 9, 2, 3, 4, 3, 1};
  printf("%d\n", s.hasIncreasingSubarrays(vec, 3));
  vec = {1, 2, 3, 4, 4, 4, 4, 5, 6, 7};
  printf("%d\n", s.hasIncreasingSubarrays(vec, 5));
}