Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    1546 - Maximum Number of Non-Overlapping Subarrays With Sum Equals Target.

    Medium

    Given an array nums and an integer target, return the maximum number of non-empty non-overlapping subarrays such that the sum of values in each subarray is equal to target.

    Example 1:

    Input: nums = 1,1,1,1,1, target = 2

    Output: 2

    Explanation: There are 2 non-overlapping subarrays **1,1** ,1, **1,1** with sum equals to target(2).

    Example 2:

    Input: nums = -1,3,5,1,4,2,-9, target = 6

    Output: 2

    Explanation: There are 3 subarrays with sum equal to 6. (5,1, 4,2, 3,5,1,4,2,-9) but only the first 2 are non-overlapping.

    Constraints:

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

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

    • <code>0 <= target <= 10<sup>6</sup></code>

    • 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 maxNonOverlapping(IntArray nums, Integer target)
      • Methods inherited from class java.lang.Object

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