/* * @LastEditTime: 2025-10-14 20:18:02 */ classSolution { private: inlineboolisOk(vector<int>& nums, int i, int k){ while (--k) { if (nums[i] >= nums[++i]) { returnfalse; } } returntrue; } public: boolhasIncreasingSubarrays(vector<int>& nums, int k){ int n = nums.size(); for (int i = 0; i + 2 * k <= n; i++) { if (isOk(nums, i, k) && isOk(nums, i + k, k)) { returntrue; } } returnfalse; } };
Python
1 2 3 4 5 6 7 8 9 10 11 12
''' LastEditTime: 2025-10-14 20:21:32 ''' from typing importList
# THIS IS NOT RIGHT classSolution: defhasIncreasingSubarrays(self, nums: List[int], k: int) -> bool: for i inrange(len(nums) - 2 * k + 1): ifall(nums[j + 1] > nums[j] for j inrange(i, i + k)) andall(nums[j + 1] > nums[j] for j inrange(i + k, i + k * 2)): returnTrue returnFalse
/* * @LastEditTime: 2025-10-14 20:31:34 */ classSolution { privatebooleanisOk(List<Integer> nums, int i, int k) { while (--k > 0) { if (nums.get(i) >= nums.get(++i)) { returnfalse; } } returntrue; }
publicbooleanhasIncreasingSubarrays(List<Integer> nums, int k) { for (inti=0; i + 2 * k <= nums.size(); i++) { // List没有length方法 if (isOk(nums, i, k) && isOk(nums, i + k, k)) { returntrue; } } returnfalse; } }
/* * @LastEditTime: 2025-10-14 20:26:58 */ package main
funcisOk3349(nums []int, i, k int)bool { for j := 0; j + 1 < k; j++ { if nums[i + j] >= nums[i + j + 1] { returnfalse } } returntrue }
funchasIncreasingSubarrays(nums []int, k int)bool { for i := 0; i + 2 * k <= len(nums); i++ { if isOk3349(nums, i, k) && isOk3349(nums, i + k, k) { returntrue } } returnfalse }