Package g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    689 - Maximum Sum of 3 Non-Overlapping Subarrays.

    Hard

    Given an integer array nums and an integer k, find three non-overlapping subarrays of length k with maximum sum and return them.

    Return the result as a list of indices representing the starting position of each interval ( 0-indexed ). If there are multiple answers, return the lexicographically smallest one.

    Example 1:

    Input: nums = 1,2,1,2,6,7,5,1, k = 2

    Output: 0,3,5

    Explanation:

    Subarrays 1, 2, 2, 6, 7, 5 correspond to the starting indices 0, 3, 5.

    We could have also taken 2, 1, but an answer of 1, 3, 5 would be lexicographically larger.

    Example 2:

    Input: nums = 1,2,1,2,1,2,1,2,1, k = 2

    Output: 0,2,4

    Constraints:

    • <code>1 <= nums.length <= 2 * 10<sup>4</sup></code>

    • <code>1 <= numsi< 2<sup>16</sup></code>

    • 1 &lt;= k &lt;= floor(nums.length / 3)

    • 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 IntArray maxSumOfThreeSubarrays(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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