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

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

A string <code>s</code> is called good if there are no two different characters in <code>s</code> that have the same frequency.

Given a string <code>s</code>, return the minimum number of characters you need to delete to make <code>s</code> good.

The frequency of a character in a string is the number of times it appears in the string. For example, in the string <code>&quot;aab&quot;</code>, the frequency of <code>&#39;a&#39;</code> is <code>2</code>, while the frequency of <code>&#39;b&#39;</code> is <code>1</code>.

&nbsp;
Example 1:

<pre>
Input: s = &quot;aab&quot;
Output: 0
Explanation: <code>s</code> is already good.
</pre>

Example 2:

<pre>
Input: s = &quot;aaabbbcc&quot;
Output: 2
Explanation: You can delete two &#39;b&#39;s resulting in the good string &quot;aaabcc&quot;.
Another way it to delete one &#39;b&#39; and one &#39;c&#39; resulting in the good string &quot;aaabbc&quot;.</pre>

Example 3:

<pre>
Input: s = &quot;ceabaacb&quot;
Output: 2
Explanation: You can delete both &#39;c&#39;s resulting in the good string &quot;eabaab&quot;.
Note that we only care about characters that are still in the string at the end (i.e. frequency of 0 is ignored).
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code>&nbsp;contains only lowercase English letters.</li>
</ul>

minDeletions

Minimum Deletions to Make Character Frequencies Unique

Minimum Deletions to Make Array Beautiful

minimum-deletions-to-make-array-beautiful

美化数组的最少删除数

Removing Minimum and Maximum From Array

removing-minimum-and-maximum-from-array

从数组中移除最大值和最小值

Remove Letter To Equalize Frequency

remove-letter-to-equalize-frequency

删除字符使频率相同

Minimum Deletions to Make String K-Special

minimum-deletions-to-make-string-k-special

成为 K 特殊字符串需要删除的最少字符数

Greedy

Hash Table

String

Sorting

如果字符串 <code>s</code> 中 不存在 两个不同字符 频次 相同的情况，就称 <code>s</code> 是 优质字符串 。

给你一个字符串 <code>s</code>，返回使 <code>s</code> 成为 优质字符串 需要删除的 最小 字符数。

字符串中字符的 频次 是该字符在字符串中的出现次数。例如，在字符串 <code>"aab"</code> 中，<code>'a'</code> 的频次是 <code>2</code>，而 <code>'b'</code> 的频次是 <code>1</code> 。

 

示例 1：

<pre>
输入：s = "aab"
输出：0
解释：<code>s</code> 已经是优质字符串。
</pre>

示例 2：

<pre>
输入：s = "aaabbbcc"
输出：2
解释：可以删除两个 'b' , 得到优质字符串 "aaabcc" 。
另一种方式是删除一个 'b' 和一个 'c' ，得到优质字符串 "aaabbc" 。</pre>

示例 3：

<pre>
输入：s = "ceabaacb"
输出：2
解释：可以删除两个 'c' 得到优质字符串 "eabaab" 。
注意，只需要关注结果字符串中仍然存在的字符。（即，频次为 0 的字符会忽略不计。）
</pre>

 

提示：

<ul>
	<li><code>1 <= s.length <= 105</code></li>
	<li><code>s</code> 仅含小写英文字母</li>
</ul>