minimum-number-of-operations-to-make-elements-in-array-distinct

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>nums</code>. You need to ensure that the elements in the array are distinct. To achieve this, you can perform the following operation any number of times:

<ul>
	<li>Remove 3 elements from the beginning of the array. If the array has fewer than 3 elements, remove all remaining elements.</li>
</ul>

Note that an empty array is considered to have distinct elements. Return the minimum number of operations needed to make the elements in the array distinct.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3,4,2,3,3,5,7]

Output: 2

Explanation:

<ul>
	<li>In the first operation, the first 3 elements are removed, resulting in the array <code>[4, 2, 3, 3, 5, 7]</code>.</li>
	<li>In the second operation, the next 3 elements are removed, resulting in the array <code>[3, 5, 7]</code>, which has distinct elements.</li>
</ul>

Therefore, the answer is 2.
</div>

Example 2:

<div class="example-block">
Input: nums = [4,5,6,4,4]

Output: 2

Explanation:

<ul>
	<li>In the first operation, the first 3 elements are removed, resulting in the array <code>[4, 4]</code>.</li>
	<li>In the second operation, all remaining elements are removed, resulting in an empty array.</li>
</ul>

Therefore, the answer is 2.
</div>

Example 3:

<div class="example-block">
Input: nums = [6,7,8,9]

Output: 0

Explanation:

The array already contains distinct elements. Therefore, the answer is 0.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
</ul>

minimumOperations

Minimum Number of Operations to Make Elements in Array Distinct

Minimum Increment to Make Array Unique

minimum-increment-to-make-array-unique

使数组唯一的最小增量

Array

Hash Table

给你一个整数数组 <code>nums</code>，你需要确保数组中的元素&nbsp;互不相同&nbsp;。为此，你可以执行以下操作任意次：

<ul>
	<li>从数组的开头移除 3 个元素。如果数组中元素少于 3 个，则移除所有剩余元素。</li>
</ul>

注意：空数组也视作为数组元素互不相同。返回使数组元素互不相同所需的&nbsp;最少操作次数&nbsp;。

&nbsp;

&nbsp;

示例 1：

<div class="example-block">
输入： nums = [1,2,3,4,2,3,3,5,7]

输出： 2

解释：

<ul>
	<li>第一次操作：移除前 3 个元素，数组变为 <code>[4, 2, 3, 3, 5, 7]</code>。</li>
	<li>第二次操作：再次移除前 3 个元素，数组变为 <code>[3, 5, 7]</code>，此时数组中的元素互不相同。</li>
</ul>

因此，答案是 2。
</div>

示例 2：

<div class="example-block">
输入： nums = [4,5,6,4,4]

输出： 2

解释：

<ul>
	<li>第一次操作：移除前 3 个元素，数组变为 <code>[4, 4]</code>。</li>
	<li>第二次操作：移除所有剩余元素，数组变为空。</li>
</ul>

因此，答案是 2。
</div>

示例 3：

<div class="example-block">
输入： nums = [6,7,8,9]

输出： 0

解释：

数组中的元素已经互不相同，因此不需要进行任何操作，答案是 0。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
</ul>