Package g0401_0500.s0410_split_array_largest_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    410 - Split Array Largest Sum.

    Hard

    Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized.

    Return the minimized largest sum of the split.

    A subarray is a contiguous part of the array.

    Example 1:

    Input: nums = 7,2,5,10,8, k = 2

    Output: 18

    Explanation: There are four ways to split nums into two subarrays. The best way is to split it into 7,2,5 and 10,8, where the largest sum among the two subarrays is only 18.

    Example 2:

    Input: nums = 1,2,3,4,5, k = 2

    Output: 9

    Explanation: There are four ways to split nums into two subarrays. The best way is to split it into 1,2,3 and 4,5, where the largest sum among the two subarrays is only 9.

    Constraints:

    • 1 <= nums.length <= 1000

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

    • 1 &lt;= k &lt;= min(50, nums.length)

    • 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 splitArray(IntArray nums, Integer m)

      • Methods inherited from class java.lang.Object

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