fair-distribution-of-cookies

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer array <code>cookies</code>, where <code>cookies[i]</code> denotes the number of cookies in the <code>ith</code> bag. You are also given an integer <code>k</code> that denotes the number of children to distribute all the bags of cookies to. All the cookies in the same bag must go to the same child and cannot be split up.

The unfairness of a distribution is defined as the maximum total cookies obtained by a single child in the distribution.

Return the minimum unfairness of all distributions.

&nbsp;
Example 1:

<pre>
Input: cookies = [8,15,10,20,8], k = 2
Output: 31
Explanation: One optimal distribution is [8,15,8] and [10,20]
- The 1st child receives [8,15,8] which has a total of 8 + 15 + 8 = 31 cookies.
- The 2nd child receives [10,20] which has a total of 10 + 20 = 30 cookies.
The unfairness of the distribution is max(31,30) = 31.
It can be shown that there is no distribution with an unfairness less than 31.
</pre>

Example 2:

<pre>
Input: cookies = [6,1,3,2,2,4,1,2], k = 3
Output: 7
Explanation: One optimal distribution is [6,1], [3,2,2], and [4,1,2]
- The 1st child receives [6,1] which has a total of 6 + 1 = 7 cookies.
- The 2nd child receives [3,2,2] which has a total of 3 + 2 + 2 = 7 cookies.
- The 3rd child receives [4,1,2] which has a total of 4 + 1 + 2 = 7 cookies.
The unfairness of the distribution is max(7,7,7) = 7.
It can be shown that there is no distribution with an unfairness less than 7.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= cookies.length &lt;= 8</code></li>
	<li><code>1 &lt;= cookies[i] &lt;= 105</code></li>
	<li><code>2 &lt;= k &lt;= cookies.length</code></li>
</ul>

distributeCookies

Fair Distribution of Cookies

Split Array Largest Sum

split-array-largest-sum

分割数组的最大值

Split Array with Equal Sum

split-array-with-equal-sum

将数组分割成和相等的子数组

Partition to K Equal Sum Subsets

partition-to-k-equal-sum-subsets

划分为k个相等的子集

Minimum XOR Sum of Two Arrays

minimum-xor-sum-of-two-arrays

两个数组最小的异或值之和

The Number of Good Subsets

the-number-of-good-subsets

好子集的数目

Minimum Number of Work Sessions to Finish the Tasks

minimum-number-of-work-sessions-to-finish-the-tasks

完成任务的最少工作时间段

Partition Array Into Two Arrays to Minimize Sum Difference

partition-array-into-two-arrays-to-minimize-sum-difference

将数组分成两个数组并最小化数组和的差

Maximum Rows Covered by Columns

maximum-rows-covered-by-columns

被列覆盖的最多行数

Distribute Money to Maximum Children

distribute-money-to-maximum-children

将钱分给最多的儿童

Bit Manipulation

Array

Dynamic Programming

Backtracking

Bitmask

给你一个整数数组 <code>cookies</code> ，其中 <code>cookies[i]</code> 表示在第 <code>i</code> 个零食包中的饼干数量。另给你一个整数 <code>k</code> 表示等待分发零食包的孩子数量，所有 零食包都需要分发。在同一个零食包中的所有饼干都必须分发给同一个孩子，不能分开。

分发的 不公平程度 定义为单个孩子在分发过程中能够获得饼干的最大总数。

返回所有分发的最小不公平程度。

&nbsp;

示例 1：

<pre>输入：cookies = [8,15,10,20,8], k = 2
输出：31
解释：一种最优方案是 [8,15,8] 和 [10,20] 。
- 第 1 个孩子分到 [8,15,8] ，总计 8 + 15 + 8 = 31 块饼干。
- 第 2 个孩子分到 [10,20] ，总计 10 + 20 = 30 块饼干。
分发的不公平程度为 max(31,30) = 31 。
可以证明不存在不公平程度小于 31 的分发方案。
</pre>

示例 2：

<pre>输入：cookies = [6,1,3,2,2,4,1,2], k = 3
输出：7
解释：一种最优方案是 [6,1]、[3,2,2] 和 [4,1,2] 。
- 第 1 个孩子分到 [6,1] ，总计 6 + 1 = 7 块饼干。 
- 第 2 个孩子分到 [3,2,2] ，总计 3 + 2 + 2 = 7 块饼干。
- 第 3 个孩子分到 [4,1,2] ，总计 4 + 1 + 2 = 7 块饼干。
分发的不公平程度为 max(7,7,7) = 7 。
可以证明不存在不公平程度小于 7 的分发方案。
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= cookies.length &lt;= 8</code></li>
	<li><code>1 &lt;= cookies[i] &lt;= 105</code></li>
	<li><code>2 &lt;= k &lt;= cookies.length</code></li>
</ul>