每日一题https://leetcode.cn/problems/adjacent-increasing-subarrays-detection-i/description/
摘要：
bool hasIncreasingSubarrays(int* nums, int numsSize, int k) { if (numsSize < 2 * k - 1) {return false;} if(k1){return true;} a:for(int u=0;u<numsSize- 阅读全文
posted @ 2024-11-13 10:51 神奇猫猫侠 阅读(46) 评论(0) 推荐(0)
浙公网安备 33010602011771号