Package g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target

Class Solution

java.lang.Object

g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target.Solution

public class Solution
extends Object

1546 - Maximum Number of Non-Overlapping Subarrays With Sum Equals Target.<p>Medium</p> <p>Given an array <code>nums</code> and an integer <code>target</code>, return <em>the maximum number of <strong>non-empty</strong> <strong>non-overlapping</strong> subarrays such that the sum of values in each subarray is equal to</em> <code>target</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,1,1,1,1], target = 2</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> There are 2 non-overlapping subarrays [<strong>1,1</strong> ,1, <strong>1,1</strong> ] with sum equals to target(2).</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [-1,3,5,1,4,2,-9], target = 6</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>-10⁴ <= nums[i] <= 10⁴</code></li> <li><code>0 <= target <= 10⁶</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxNonOverlapping(int[] nums, int target)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

maxNonOverlapping

public int maxNonOverlapping(int[] nums,
 int target)