Package g3401_3500.s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays

Class Solution

java.lang.Object

g3401_3500.s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays.Solution

public class Solution
extends Object

3430 - Maximum and Minimum Sums of at Most Size K Subarrays.

Hard

You are given an integer array nums and a positive integer k. Return the sum of the maximum and minimum elements of all non-empty subarrays with at most k elements.

Example 1:

Input: nums = [1,2,3], k = 2

Output: 20

Explanation:

The subarrays of nums with at most 2 elements are:

Subarray	Minimum	Maximum	Sum
[1]	1	1	2
[2]	2	2	4
[3]	3	3	6
[1, 2]	1	2	3
[2, 3]	2	3	5
Final Total			20

The output would be 20.

Example 2:

Input: nums = [1,-3,1], k = 2

Output: -6

Explanation:

The subarrays of nums with at most 2 elements are:

Subarray	Minimum	Maximum	Sum
[1]	1	1	2
[-3]	-3	-3	-6
[1]	1	1	2
[1, -3]	-3	1	-2
[-3, 1]	-3	1	-2
Final Total			-6

The output would be -6.

Constraints:

• 1 <= nums.length <= 80000
• 1 <= k <= nums.length
• -106 <= nums[i] <= 106

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
long	minMaxSubarraySum(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

minMaxSubarraySum

public long minMaxSubarraySum(int[] nums,
 int k)