leetcode.com 209. Minimum Size Subarray Sum

문제 링크: https://leetcode.com/problems/minimum-size-subarray-sum

Author: skysign

leetcode.com 209. Minimum Size Subarray Sum/main.py

@@ -0,0 +1,31 @@
+import sys
+from typing import List
+
+
+class Solution:
+    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
+        if len(nums) < 2:
+            if target <= nums[0]:
+                return 1
+            return 0
+
+        answer = sys.maxsize
+        left, right = 0, 0
+        sm = nums[0]
+
+        while left <= right and right < len(nums):
+            if sm >= target:
+                answer = min(answer, right + 1 - left)
+                sm -= nums[left]
+                left += 1
+            else: # sm < target
+                right += 1
+                if right >= len(nums):
+                    break
+                sm += nums[right]
+
+        if answer == sys.maxsize:
+            return 0
+
+        return answer
+

leetcode.com 209. Minimum Size Subarray Sum/test_main.py

@@ -0,0 +1,7 @@
+from unittest import TestCase
+from main import Solution
+
+class TestSolution(TestCase):
+    def test1_min_sub_array_len(self):
+        sln = Solution()
+        self.assertEqual(2, sln.minSubArrayLen(target = 7, nums = [2,3,1,2,4,3]))