Package g1601_1700.s1636_sort_array_by_increasing_frequency

Class Solution

java.lang.Object

g1601_1700.s1636_sort_array_by_increasing_frequency.Solution

public class Solution
extends Object

1636 - Sort Array by Increasing Frequency.<p>Easy</p> <p>Given an array of integers <code>nums</code>, sort the array in <strong>increasing</strong> order based on the frequency of the values. If multiple values have the same frequency, sort them in <strong>decreasing</strong> order.</p> <p>Return the <em>sorted array</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,1,2,2,2,3]</p> <p><strong>Output:</strong> [3,1,1,2,2,2]</p> <p><strong>Explanation:</strong> &lsquo;3&rsquo; has a frequency of 1, &lsquo;1&rsquo; has a frequency of 2, and &lsquo;2&rsquo; has a frequency of 3.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,3,1,3,2]</p> <p><strong>Output:</strong> [1,3,3,2,2]</p> <p><strong>Explanation:</strong> &lsquo;2&rsquo; and &lsquo;3&rsquo; both have a frequency of 2, so they are sorted in decreasing order.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [-1,1,-6,4,5,-6,1,4,1]</p> <p><strong>Output:</strong> [5,-1,4,4,-6,-6,1,1,1]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 100</code></li> <li><code>-100 <= nums[i] <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	frequencySort(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

frequencySort

public int[] frequencySort(int[] nums)