diff --git "a/Learning/\345\205\250\346\240\210/\344\270\201\346\201\251\346\263\275/\347\254\254\344\270\200\346\254\241\344\273\273\345\212\241/1.txt" "b/Learning/\345\205\250\346\240\210/\344\270\201\346\201\251\346\263\275/\347\254\254\344\270\200\346\254\241\344\273\273\345\212\241/1.txt"
new file mode 100644
index 0000000000000000000000000000000000000000..0a08785906406ee2afcdf6055c7be8c8de3e9674
--- /dev/null
+++ "b/Learning/\345\205\250\346\240\210/\344\270\201\346\201\251\346\263\275/\347\254\254\344\270\200\346\254\241\344\273\273\345\212\241/1.txt"
@@ -0,0 +1,32 @@
+/**
+ * @param {number} target
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minSubArrayLen = function(target, nums) {
+        let left=0;
+        let right =-1;
+        //当前子数组的和
+        let sum = 0;
+        //返回的最小子数组的长度
+        let res = nums.length+1;
+        while (left<nums.length){
+            //存在滑动窗口
+            if(right+1 <nums.length && sum <target){
+                right ++;
+                sum += nums[right];
+            }
+            else{
+                sum -=nums[left];
+                left ++;
+            }
+
+            if(sum >=target){
+                res = Math.min(res,right-left+1);
+            }
+        }
+        if(res == nums.length+1){
+            return 0;
+        }
+        return res; 
+};