feat: leetcode 1636

Author: ouduidui

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:498-green" alt="进度:498">
+<img src="https://img.shields.io/badge/-进度:499-green" alt="进度:499">
 <!-- TOPICS COUNT END -->
 <a href="./assets/docs/TOPICS.md"><img src="https://img.shields.io/badge/-题库目录-blue" alt="题库目录"></a>
 <a href="./assets/docs/CATEGORIES.md"><img src="https://img.shields.io/badge/-题库分类-red" alt="题库分类"></a>

assets/data/categories.json

@@ -2429,6 +2429,12 @@
         "path": "./problemset/find-servers-that-handled-most-number-of-requests/README.md",
         "difficulty": "困难"
       },
+      {
+        "id": "1636",
+        "title": "按照频率将数组升序排序",
+        "path": "./problemset/sort-array-by-increasing-frequency/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "1656",
         "title": "涉及有序流",

assets/data/topics.json

@@ -4599,6 +4599,16 @@
     "url": "https://leetcode.cn/problems/largest-substring-between-two-equal-characters/",
     "path": "./problemset/largest-substring-between-two-equal-characters/README.md"
   },
+  {
+    "id": "1636",
+    "title": {
+      "cn": "按照频率将数组升序排序",
+      "en": "sort-array-by-increasing-frequency"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/sort-array-by-increasing-frequency/",
+    "path": "./problemset/sort-array-by-increasing-frequency/README.md"
+  },
   {
     "id": "1656",
     "title": {

assets/docs/CATEGORIES.md

@@ -446,6 +446,7 @@
 | 1582. [二进制矩阵中的特殊位置](../../problemset/special-positions-in-a-binary-matrix/README.md) | 简单 |
 | 1592. [重新排列单词间的空格](../../problemset/rearrange-spaces-between-words/README.md) | 简单 |
 | 1606. [找到处理最多请求的服务器](../../problemset/find-servers-that-handled-most-number-of-requests/README.md) | 困难 |
+| 1636. [按照频率将数组升序排序](../../problemset/sort-array-by-increasing-frequency/README.md) | 简单 |
 | 1656. [涉及有序流](../../problemset/design-an-ordered-stream/README.md) | 简单 |
 | 1672. [最富有客户的资产总量](../../problemset/richest-customer-wealth/README.md) | 简单 |
 | 1706. [球会落何处](../../problemset/where-will-the-ball-fall/README.md) | 中等 |

assets/docs/TOPICS.md

@@ -920,6 +920,8 @@
 
 [1624. 两个相同字符之间的最长子字符串](../../problemset/largest-substring-between-two-equal-characters/README.md)
 
+[1636. 按照频率将数组升序排序](../../problemset/sort-array-by-increasing-frequency/README.md)
+
 [1656. 涉及有序流](../../problemset/design-an-ordered-stream/README.md)
 
 [1663. 具有给定数值的最小字符串](../../problemset/smallest-string-with-a-given-numeric-value/README.md)

problemset/sort-array-by-increasing-frequency/README.md

@@ -0,0 +1,64 @@
+# 按照频率将数组升序排序
+
+> 难度：简单
+>
+> https://leetcode.cn/problems/sort-array-by-increasing-frequency/
+
+## 题目
+
+给你一个整数数组 `nums` ，请你将数组按照每个值的频率 **升序** 排序。如果有多个值的频率相同，请你按照数值本身将它们 **降序** 排序。 
+
+请你返回排序后的数组。
+
+### 示例
+
+#### 示例 1：
+
+```
+输入：nums = [1,1,2,2,2,3]
+输出：[3,1,1,2,2,2]
+解释：'3' 频率为 1，'1' 频率为 2，'2' 频率为 3 。
+```
+
+#### 示例 2：
+
+```
+输入：nums = [2,3,1,3,2]
+输出：[1,3,3,2,2]
+解释：'2' 和 '3' 频率都为 2 ，所以它们之间按照数值本身降序排序。
+```
+
+#### 示例 3：
+
+```
+输入：nums = [-1,1,-6,4,5,-6,1,4,1]
+输出：[5,-1,4,4,-6,-6,1,1,1]
+```
+
+## 解题
+
+```ts 
+/**
+ * 模拟
+ * @desc 时间复杂度 O(NlogN) 空间复杂度 O(N)
+ * @param nums
+ * @returns
+ */
+export function frequencySort(nums: number[]): number[] {
+  const cnt = new Map<number, number>()
+  for (const num of nums)
+    cnt.set(num, (cnt.get(num) || 0) + 1)
+
+  const list = [...nums]
+  list.sort((a, b) => {
+    const cnt1 = cnt.get(a)!
+    const cnt2 = cnt.get(b)!
+    return cnt1 !== cnt2 ? cnt1 - cnt2 : b - a
+  })
+  const length = nums.length
+  for (let i = 0; i < length; i++)
+    nums[i] = list[i]
+
+  return nums
+}
+```

problemset/sort-array-by-increasing-frequency/index.spec.ts

@@ -0,0 +1,25 @@
+import { describe, expect, it } from 'vitest'
+import { frequencySort } from '.'
+
+describe('按照频率将数组升序排序', () => {
+  testCase(frequencySort)
+})
+
+function testCase(fn: (nums: number[]) => number[]) {
+  it.each([
+    [
+      [1, 1, 2, 2, 2, 3],
+      [3, 1, 1, 2, 2, 2],
+    ],
+    [
+      [2, 3, 1, 3, 2],
+      [1, 3, 3, 2, 2],
+    ],
+    [
+      [-1, 1, -6, 4, 5, -6, 1, 4, 1],
+      [5, -1, 4, 4, -6, -6, 1, 1, 1],
+    ],
+  ])('示例%#', (nums, expected) => {
+    expect(fn(nums)).toStrictEqual(expected)
+  })
+}

problemset/sort-array-by-increasing-frequency/index.ts

@@ -0,0 +1,23 @@
+/**
+ * 模拟
+ * @desc 时间复杂度 O(NlogN) 空间复杂度 O(N)
+ * @param nums
+ * @returns
+ */
+export function frequencySort(nums: number[]): number[] {
+  const cnt = new Map<number, number>()
+  for (const num of nums)
+    cnt.set(num, (cnt.get(num) || 0) + 1)
+
+  const list = [...nums]
+  list.sort((a, b) => {
+    const cnt1 = cnt.get(a)!
+    const cnt2 = cnt.get(b)!
+    return cnt1 !== cnt2 ? cnt1 - cnt2 : b - a
+  })
+  const length = nums.length
+  for (let i = 0; i < length; i++)
+    nums[i] = list[i]
+
+  return nums
+}