209. Minimum Size Subarray Sum

• Explore
• Problems
• Mock 
• Contest
• Articles
• Discuss
•  Store 

•  Premium

• 

•  
• 

 743

 48

 

209. Minimum Size Subarray Sum

DescriptionHintsSubmissionsDiscussSolution

Pick One

---

Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.

Example: 

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.

Follow up:

If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n). 

---

Seen this question in a real interview before?  No

Thanks for your feedback.

• Difficulty:Medium
• Total Accepted:141.7K
• Total Submissions:426K
• Contributor:Freezen
•  

• Subscribe to see which companies asked this question.

  Related Topics 

  ArrayTwo PointersBinary Search

  Similar Questions 

  Minimum Window SubstringMaximum Size Subarray Sum Equals kMaximum Length of Repeated Subarray

---

Java

 

1

class Solution {

2

    public int minSubArrayLen(int s, int[] nums) {

3

4

        int minSum = 0;

5

        int left = 0;

6

        int right =0;

7

        int minCount = Integer.MAX_VALUE;

8

        while( right < nums.length){

9

10

            if(minSum + nums[right]>=s){

11

                if(left == right){

12

                    return 1;

13

                }

14

                if(right-left+1<minCount){

15

                    minCount = right-left+1;

16

                }

17

                minSum -= nums[left++];

18

19

            }else{

20

                minSum += nums[right];

21

                right++;

22

            }

23

        }

24

        if(minCount == Integer.MAX_VALUE){

25

            return 0;

26

        }

27

       return minCount;

28

29

    }

30

}

  Custom Testcase

( Contribute  )

 Run Code Submit Solution

Notes

|||

 

Type here...(Markdown is enabled)

​

---

Copyright © 2018 LeetCode

Contact Us  |  Jobs  |  Bug Bounty  |  Students  |  FAQ  |  Terms  |  Privacy Policy      United States