sort-array-by-increasing-frequency

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of integers <code>nums</code>, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequency, sort them in decreasing order.

Return the sorted array.

&nbsp;
Example 1:

<pre>
Input: nums = [1,1,2,2,2,3]
Output: [3,1,1,2,2,2]
Explanation: &#39;3&#39; has a frequency of 1, &#39;1&#39; has a frequency of 2, and &#39;2&#39; has a frequency of 3.
</pre>

Example 2:

<pre>
Input: nums = [2,3,1,3,2]
Output: [1,3,3,2,2]
Explanation: &#39;2&#39; and &#39;3&#39; both have a frequency of 2, so they are sorted in decreasing order.
</pre>

Example 3:

<pre>
Input: nums = [-1,1,-6,4,5,-6,1,4,1]
Output: [5,-1,4,4,-6,-6,1,1,1]</pre>

&nbsp;
Constraints:

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

frequencySort

Sort Array by Increasing Frequency

Sort Characters By Frequency

sort-characters-by-frequency

根据字符出现频率排序

Divide Array Into Equal Pairs

divide-array-into-equal-pairs

将数组划分成相等数对

Most Frequent Number Following Key In an Array

most-frequent-number-following-key-in-an-array

数组中紧跟 key 之后出现最频繁的数字

Maximum Number of Pairs in Array

maximum-number-of-pairs-in-array

数组能形成多少数对

Node With Highest Edge Score

node-with-highest-edge-score

边积分最高的节点

Sort the People

sort-the-people

按身高排序

Array

Hash Table

Sorting

给你一个整数数组 <code>nums</code> ，请你将数组按照每个值的频率 升序 排序。如果有多个值的频率相同，请你按照数值本身将它们 降序 排序。 

请你返回排序后的数组。

 

示例 1：

<pre>输入：nums = [1,1,2,2,2,3]
输出：[3,1,1,2,2,2]
解释：'3' 频率为 1，'1' 频率为 2，'2' 频率为 3 。
</pre>

示例 2：

<pre>输入：nums = [2,3,1,3,2]
输出：[1,3,3,2,2]
解释：'2' 和 '3' 频率都为 2 ，所以它们之间按照数值本身降序排序。
</pre>

示例 3：

<pre>输入：nums = [-1,1,-6,4,5,-6,1,4,1]
输出：[5,-1,4,4,-6,-6,1,1,1]</pre>

 

提示：

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