[Medium] Title: 209. Minimum Size Subarray Sum - LeetCode

Author: JinHyung-dev

LeetCode/Medium/209. Minimum Size Subarray Sum/Minimum Size Subarray Sum.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int minSubArrayLen(int target, int[] nums) {
+        int result = Integer.MAX_VALUE;
+        int left = 0;
+        int right = 0;
+        int sum = 0;
+        while(right < nums.length) {
+            sum += nums[right++];
+            while(sum >= target) {
+                result = Math.min(result, right - left);
+                sum -= nums[left++];
+            }
+        }
+        return (result == Integer.MAX_VALUE) ? 0 : result;
+    }
+}

LeetCode/Medium/209. Minimum Size Subarray Sum/README.md

@@ -0,0 +1,31 @@
+# [Midium] 209. Minimum Size Subarray Sum 
+
+[문제 링크](https://leetcode.com/problems/minimum-size-subarray-sum/description/?envType=study-plan-v2&envId=top-interview-150)
+
+### 문제 설명
+Given an array of positive integers`nums`and a positive integer`target`, return*the**minimal length**of asubarraywhose sum is greater than or equal to*`target`. If there is no such subarray, return`0`instead.
+
+### 입출력
+Example 1:
+
+```Input: target = 7, nums = [2,3,1,2,4,3]
+Output: 2
+```
+Explanation: The subarray [4,3] has the minimal length under the problem constraint.
+
+Example 2:
+
+```Input: target = 4, nums = [1,4,4]
+Output: 1
+```
+
+Example 3:
+```
+Input: target = 11, nums = [1,1,1,1,1,1,1,1]
+Output: 0
+```
+### 문제설명
+Constraints:
+- 1 <= target <= 109
+- 1 <= nums.length <= 105
+- 1 <= nums[i] <= 104