<div id="readability-page-1" class="page"><div>
 
 
 <hr>
 <article itemscope="" itemtype="http://schema.org/BlogPosting">
 <ul id="markdown-toc">
 <li><a href="#209-minimum-size-subarray-sum" id="markdown-toc-209-minimum-size-subarray-sum">209. Minimum Size Subarray Sum</a> <ul>
 <li><a href="#problem" id="markdown-toc-problem">Problem</a></li>
 <li><a href="#example" id="markdown-toc-example">Example</a></li>
 <li><a href="#1-code-23-06-10" id="markdown-toc-1-code-23-06-10">[1] Code (23. 06. 10)</a></li>
 </ul>
 </li>
 <li><a href="#reference" id="markdown-toc-reference">Reference</a></li>
</ul>

<h2 id="209-minimum-size-subarray-sum"><a href="https://leetcode.com/problems/minimum-size-subarray-sum">209. Minimum Size Subarray Sum</a></h2>

<h3 id="problem">Problem</h3>

<div><pre><code>Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.
</code></pre></div>

<hr>

<h3 id="example">Example</h3>

<div><pre><code>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.
</code></pre></div>

<hr>

<h3 id="1-code-23-06-10">[1] Code (23. 06. 10)</h3>

Need to Retry -&gt; Sliding Window

<div><pre><code>// Runtime: 1 ms
// Memory Usage: 56.2 MB
// Ref : https://leetcode.com/submissions/detail/967977519
class Solution {
 public int minSubArrayLen(int target, int[] nums) {
 int left = 0, right = 0, sumOfCurrentWindow = 0;
 int res = Integer.MAX_VALUE;

 for (right = 0; right &lt; nums.length; right++) {
 sumOfCurrentWindow += nums[right];

 while (sumOfCurrentWindow &gt;= target) {
 res = Math.min(res, right - left + 1);
 sumOfCurrentWindow -= nums[left++];
 }
 }

 return res == Integer.MAX_VALUE ? 0 : res;
 }
}
</code></pre></div>

<hr>

<blockquote>
 Review
</blockquote>

<ul>
 <li>굉장히 재밌었던 문제 !!!</li>
</ul>

<hr>

<h2 id="reference">Reference</h2>

<ul>
 <li><a href="https://leetcode.com/problems/minimum-size-subarray-sum">209. Minimum Size Subarray Sum</a></li>
</ul>

 </article>
 
 <hr>

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

 


 <h2 id="comments">Comments</h2>
 






 </div></div>

Gidhub

209. Minimum Size Subarray Sum 
Problem
Example
[1] Code (23. 06. 10)
Reference
209. Minimum Size Subarray Sum
Problem
Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.
Example
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.
[1] Code (23. 06. 10)
Need to Retry -> Sliding Window
// Runtime: 1 ms
// Memory Usage: 56.2 MB
// Ref : https://leetcode.com/submissions/detail/967977519
class Solution {
 public int minSubArrayLen(int target, int[] nums) {
 int left = 0, right = 0, sumOfCurrentWindow = 0;
 int res = Integer.MAX_VALUE;
 for (right = 0; right < nums.length; right++) {
 sumOfCurrentWindow += nums[right];
 while (sumOfCurrentWindow >= target) {
 res = Math.min(res, right - left + 1);
 sumOfCurrentWindow -= nums[left++];
 }
 }
 return res == Integer.MAX_VALUE ? 0 : res;
 }
}
Review
굉장히 재밌었던 문제 !!!
Reference
209. Minimum Size Subarray Sum

LeetCode : 209. Minimum Size Subarray Sum

댓글