distribute-candies

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Alice has <code>n</code> candies, where the <code>ith</code> candy is of type <code>candyType[i]</code>. Alice noticed that she started to gain weight, so she visited a doctor.

The doctor advised Alice to only eat <code>n / 2</code> of the candies she has (<code>n</code> is always even). Alice likes her candies very much, and she wants to eat the maximum number of different types of candies while still following the doctor&#39;s advice.

Given the integer array <code>candyType</code> of length <code>n</code>, return the maximum number of different types of candies she can eat if she only eats <code>n / 2</code> of them.

&nbsp;
Example 1:

<pre>
Input: candyType = [1,1,2,2,3,3]
Output: 3
Explanation: Alice can only eat 6 / 2 = 3 candies. Since there are only 3 types, she can eat one of each type.
</pre>

Example 2:

<pre>
Input: candyType = [1,1,2,3]
Output: 2
Explanation: Alice can only eat 4 / 2 = 2 candies. Whether she eats types [1,2], [1,3], or [2,3], she still can only eat 2 different types.
</pre>

Example 3:

<pre>
Input: candyType = [6,6,6,6]
Output: 1
Explanation: Alice can only eat 4 / 2 = 2 candies. Even though she can eat 2 candies, she only has 1 type.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == candyType.length</code></li>
	<li><code>2 &lt;= n &lt;= 104</code></li>
	<li><code>n</code>&nbsp;is even.</li>
	<li><code>-105 &lt;= candyType[i] &lt;= 105</code></li>
</ul>

distributeCandies

Distribute Candies

Minimum Number of Operations to Satisfy Conditions

minimum-number-of-operations-to-satisfy-conditions

使矩阵满足条件的最少操作次数

Check if Grid Satisfies Conditions

check-if-grid-satisfies-conditions

判断矩阵是否满足条件

Array

Hash Table

Alice 有 <code>n</code> 枚糖，其中第 <code>i</code> 枚糖的类型为 <code>candyType[i]</code> 。Alice 注意到她的体重正在增长，所以前去拜访了一位医生。

医生建议 Alice 要少摄入糖分，只吃掉她所有糖的 <code>n / 2</code> 即可（<code>n</code> 是一个偶数）。Alice 非常喜欢这些糖，她想要在遵循医生建议的情况下，尽可能吃到最多不同种类的糖。

给你一个长度为 <code>n</code> 的整数数组 <code>candyType</code> ，返回： Alice 在仅吃掉 <code>n / 2</code> 枚糖的情况下，可以吃到糖的 最多 种类数。

&nbsp;

示例 1：

<pre>
输入：candyType = [1,1,2,2,3,3]
输出：3
解释：Alice 只能吃 6 / 2 = 3 枚糖，由于只有 3 种糖，她可以每种吃一枚。
</pre>

示例 2：

<pre>
输入：candyType = [1,1,2,3]
输出：2
解释：Alice 只能吃 4 / 2 = 2 枚糖，不管她选择吃的种类是 [1,2]、[1,3] 还是 [2,3]，她只能吃到两种不同类的糖。
</pre>

示例 3：

<pre>
输入：candyType = [6,6,6,6]
输出：1
解释：Alice 只能吃 4 / 2 = 2 枚糖，尽管她能吃 2 枚，但只能吃到 1 种糖。
</pre>

&nbsp;

提示：

<ul>
	<li><code>n == candyType.length</code></li>
	<li><code>2 &lt;= n &lt;= 104</code></li>
	<li><code>n</code> 是一个偶数</li>
	<li><code>-105 &lt;= candyType[i] &lt;= 105</code></li>
</ul>