From b5e85a8f0df13cb96dc913b0769347b3dce0d7a7 Mon Sep 17 00:00:00 2001 From: yoouyeon Date: Sat, 13 Sep 2025 21:39:32 +0900 Subject: [PATCH] =?UTF-8?q?=F0=9F=92=A1=20=EB=A6=AC=ED=8A=B8=EC=BD=94?= =?UTF-8?q?=EB=93=9C=20209=20-=20Minimum=20Size=20Subarray=20Sum?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- Leetcode/209.minimum-size-subarray-sum.ts | 24 +++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 Leetcode/209.minimum-size-subarray-sum.ts diff --git a/Leetcode/209.minimum-size-subarray-sum.ts b/Leetcode/209.minimum-size-subarray-sum.ts new file mode 100644 index 0000000..d6a2aab --- /dev/null +++ b/Leetcode/209.minimum-size-subarray-sum.ts @@ -0,0 +1,24 @@ +/* + * [209] Minimum Size Subarray Sum + */ + +function minSubArrayLen(target: number, nums: number[]): number { + let minLength = Infinity; + let left = 0, + right = left; + let sum = 0; + + while (right < nums.length) { + if (sum < target) { + sum += nums[right]; + right++; + } + while (sum >= target) { + minLength = Math.min(minLength, right - left); + sum -= nums[left]; + left++; + } + } + + return minLength === Infinity ? 0 : minLength; +}