代码训练营Day3|滑动窗口算法

题目链接https://leetcode.cn/problems/minimum-size-subarray-sum/视频讲解https://www.bilibili.com/video/BV1tZ4y1q7XE我的答题https://leetcode.cn/problems/minimum-size-subarray-sum/submissions/718523789/学习目标理解滑动窗口学习内容滑动窗口右指针right遍历数组每次加入元素后若窗口和target就用while不断收缩边界记得最短长度。时间复杂度O(n)空间复杂度O(1)学习时间晚上 7 点—晚上9点 看视频9 点-上午 11 点 写代码学习产出intminSubArrayLen(inttarget,int*nums,intnumsSize){intleft0,sum0,minLenINT_MAX;for(intright0;rightnumsSize;right){sumnums[right];while(sumtarget){intcurlenright-left1;if(curlenminLen){minLencurlen;}sum-nums[left];left;}}returnminLenINT_MAX?0:minLen;}