minimum-deletions-to-make-array-beautiful

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 a 0-indexed integer array <code>nums</code>. The array <code>nums</code> is beautiful if:

<ul>
	<li><code>nums.length</code> is even.</li>
	<li><code>nums[i] != nums[i + 1]</code> for all <code>i % 2 == 0</code>.</li>
</ul>

Note that an empty array is considered beautiful.

You can delete any number of elements from <code>nums</code>. When you delete an element, all the elements to the right of the deleted element will be shifted one unit to the left to fill the gap created and all the elements to the left of the deleted element will remain unchanged.

Return the minimum number of elements to delete from <code>nums</code> to make it beautiful.

&nbsp;
Example 1:

<pre>
Input: nums = [1,1,2,3,5]
Output: 1
Explanation: You can delete either <code>nums[0]</code> or <code>nums[1]</code> to make <code>nums</code> = [1,2,3,5] which is beautiful. It can be proven you need at least 1 deletion to make <code>nums</code> beautiful.
</pre>

Example 2:

<pre>
Input: nums = [1,1,2,2,3,3]
Output: 2
Explanation: You can delete <code>nums[0]</code> and <code>nums[5]</code> to make nums = [1,2,2,3] which is beautiful. It can be proven you need at least 2 deletions to make nums beautiful.
</pre>

&nbsp;
Constraints:

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

minDeletion

Minimum Deletions to Make Array Beautiful

Minimum Deletions to Make Character Frequencies Unique

minimum-deletions-to-make-character-frequencies-unique

字符频次唯一的最小删除次数

Minimum Operations to Make the Array Alternating

minimum-operations-to-make-the-array-alternating

使数组变成交替数组的最少操作数

Stack

Greedy

Array

给你一个下标从 0 开始的整数数组 <code>nums</code> ，如果满足下述条件，则认为数组 <code>nums</code> 是一个 美丽数组 ：

<ul>
	<li><code>nums.length</code> 为偶数</li>
	<li>对所有满足 <code>i % 2 == 0</code> 的下标 <code>i</code> ，<code>nums[i] != nums[i + 1]</code> 均成立</li>
</ul>

注意，空数组同样认为是美丽数组。

你可以从 <code>nums</code> 中删除任意数量的元素。当你删除一个元素时，被删除元素右侧的所有元素将会向左移动一个单位以填补空缺，而左侧的元素将会保持 不变 。

返回使 <code>nums</code> 变为美丽数组所需删除的 最少 元素数目。

&nbsp;

示例 1：

<pre>输入：nums = [1,1,2,3,5]
输出：1
解释：可以删除 <code>nums[0]</code> 或 <code>nums[1]</code> ，这样得到的 <code>nums</code> = [1,2,3,5] 是一个美丽数组。可以证明，要想使 nums 变为美丽数组，至少需要删除 1 个元素。</pre>

示例 2：

<pre>输入：nums = [1,1,2,2,3,3]
输出：2
解释：可以删除 <code>nums[0]</code> 和 <code>nums[5]</code> ，这样得到的 nums = [1,2,2,3] 是一个美丽数组。可以证明，要想使 nums 变为美丽数组，至少需要删除 2 个元素。
</pre>

&nbsp;

提示：

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