Package g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays

Class Solution

java.lang.Object

g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays.Solution

public class Solution
extends Object

689 - Maximum Sum of 3 Non-Overlapping Subarrays.<p>Hard</p> <p>Given an integer array <code>nums</code> and an integer <code>k</code>, find three non-overlapping subarrays of length <code>k</code> with maximum sum and return them.</p> <p>Return the result as a list of indices representing the starting position of each interval ( <strong>0-indexed</strong> ). If there are multiple answers, return the lexicographically smallest one.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,1,2,6,7,5,1], k = 2</p> <p><strong>Output:</strong> [0,3,5]</p> <p><strong>Explanation:</strong></p> <p>Subarrays [1, 2], [2, 6], [7, 5] correspond to the starting indices [0, 3, 5].</p> <p>We could have also taken [2, 1], but an answer of [1, 3, 5] would be lexicographically larger.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2,1,2,1,2,1,2,1], k = 2</p> <p><strong>Output:</strong> [0,2,4]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 2 * 10⁴</code></li> <li><code>1 <= nums[i] < 2¹⁶</code></li> <li><code>1 <= k <= floor(nums.length / 3)</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	maxSumOfThreeSubarrays(int[] nums, int k)

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

maxSumOfThreeSubarrays

public int[] maxSumOfThreeSubarrays(int[] nums,
 int k)