split-array-largest-sum

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code> and an integer <code>k</code>, split <code>nums</code> into <code>k</code> 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.

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

<pre>
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.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 106</code></li>
	<li><code>1 &lt;= k &lt;= min(50, nums.length)</code></li>
</ul>

splitArray

Split Array Largest Sum

Capacity To Ship Packages Within D Days

capacity-to-ship-packages-within-d-days

在 D 天内送达包裹的能力

Divide Chocolate

divide-chocolate

分享巧克力

Fair Distribution of Cookies

fair-distribution-of-cookies

公平分发饼干

Subsequence of Size K With the Largest Even Sum

subsequence-of-size-k-with-the-largest-even-sum

长度为 K 的最大偶数和子序列

Maximum Total Beauty of the Gardens

maximum-total-beauty-of-the-gardens

花园的最大总美丽值

Number of Ways to Split Array

number-of-ways-to-split-array

分割数组的方案数

Minimum Cost to Split an Array

minimum-cost-to-split-an-array

拆分数组的最小代价

Distribute Elements Into Two Arrays I

distribute-elements-into-two-arrays-i

将元素分配到两个数组中 I

Distribute Elements Into Two Arrays II

distribute-elements-into-two-arrays-ii

将元素分配到两个数组中 II

Greedy

Array

Binary Search

Dynamic Programming

Prefix Sum

&#32473;&#23450;&#19968;&#20010;&#38750;&#36127;&#25972;&#25968;&#25968;&#32452; <code>nums</code> &#21644;&#19968;&#20010;&#25972;&#25968;&nbsp;<code>k</code> &#65292;&#20320;&#38656;&#35201;&#23558;&#36825;&#20010;&#25968;&#32452;&#20998;&#25104;&nbsp;<code>k</code>&nbsp;&#20010;&#38750;&#31354;&#30340;&#36830;&#32493;&#23376;&#25968;&#32452;&#65292;&#20351;&#24471;&#36825;&nbsp;<code>k</code>&nbsp;&#20010;&#23376;&#25968;&#32452;&#21508;&#33258;&#21644;&#30340;&#26368;&#22823;&#20540; &#26368;&#23567;&#12290;

&#36820;&#22238;&#20998;&#21106;&#21518;&#26368;&#23567;&#30340;&#21644;&#30340;&#26368;&#22823;&#20540;&#12290;

&#23376;&#25968;&#32452; &#26159;&#25968;&#32452;&#20013;&#36830;&#32493;&#30340;&#37096;&#20998;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [7,2,5,10,8], k = 2
&#36755;&#20986;&#65306;18
&#35299;&#37322;&#65306;
&#19968;&#20849;&#26377;&#22235;&#31181;&#26041;&#27861;&#23558; nums &#20998;&#21106;&#20026; 2 &#20010;&#23376;&#25968;&#32452;&#12290; 
&#20854;&#20013;&#26368;&#22909;&#30340;&#26041;&#24335;&#26159;&#23558;&#20854;&#20998;&#20026; [7,2,5] &#21644; [10,8] &#12290;
&#22240;&#20026;&#27492;&#26102;&#36825;&#20004;&#20010;&#23376;&#25968;&#32452;&#21508;&#33258;&#30340;&#21644;&#30340;&#26368;&#22823;&#20540;&#20026;18&#65292;&#22312;&#25152;&#26377;&#24773;&#20917;&#20013;&#26368;&#23567;&#12290;</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [1,2,3,4,5], k = 2
&#36755;&#20986;&#65306;9
</pre>

&#31034;&#20363; 3&#65306;

<pre>
&#36755;&#20837;&#65306;nums = [1,4,4], k = 3
&#36755;&#20986;&#65306;4
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 106</code></li>
	<li><code>1 &lt;= k &lt;= min(50, nums.length)</code></li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support