* @lc app=leetcode id=209 lang=javascript
* [209] Minimum Size Subarray Sum
var minSubArrayLen = function (s, nums) {
if (nums.length === 0) return 0;
for (let i = 0; i < nums.length + 1; i++) {
if (min === null || slideWindow.length < min) {
min = slideWindow.length;
acc = acc - slideWindow.shift();
acc = slideWindow.reduce((a, b) => a + b, 0);