-
https://leetcode.com/problems/minimum-size-subarray-sum/
var minSubArrayLen = function(target, nums) { let left = right = 0; let min = Number.MAX_SAFE_INTEGER; let sum = 0; for(right = 0; right < nums.length; right++) { sum += nums[right]; while(sum >= target) { min = Math.min(min, right - left + 1); sum -= nums[left]; left++; } } if(min === Number.MAX_SAFE_INTEGER) return 0; return min; };
'알고리즘 > 리트코드' 카테고리의 다른 글
856. Score of Parentheses (0) 2021.07.14 47. Permutations II (1) 2021.06.20 137. Single Number II (0) 2021.06.19 287. Find the Duplicate Number (0) 2021.06.18 153. Find Minimum in Rotated Sorted Array (0) 2021.06.17 댓글