Package g0201_0300.s0209_minimum_size_subarray_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    209 - Minimum Size Subarray Sum.

    Medium

    Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray <code>nums<sub>l</sub>, nums<sub>l+1</sub>, ..., nums<sub>r-1</sub>, nums<sub>r</sub></code> of which the 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:

    • <code>1 <= target <= 10<sup>9</sup></code>

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>1 <= numsi<= 10<sup>4</sup></code>

    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)).

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minSubArrayLen(Integer s, IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait