feat: leetcode 383

Author: deweyou

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:417-green" alt="进度:417">
+<img src="https://img.shields.io/badge/-进度:418-green" alt="进度:418">
 <!-- 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

@@ -176,6 +176,12 @@
         "path": "./problemset/insert-delete-getrandom-o1/README.md",
         "difficulty": "中等"
       },
+      {
+        "id": "383",
+        "title": "赎金信",
+        "path": "./problemset/ransom-note/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "398",
         "title": "随机数索引",

assets/data/topics.json

@@ -2709,6 +2709,16 @@
     "url": "https://leetcode-cn.com/problems/insert-delete-getrandom-o1/",
     "path": "./problemset/insert-delete-getrandom-o1/README.md"
   },
+  {
+    "id": "383",
+    "title": {
+      "cn": "赎金信",
+      "en": "ransom-note"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/ransom-note/",
+    "path": "./problemset/ransom-note/README.md"
+  },
   {
     "id": "385",
     "title": {
@@ -4169,4 +4179,4 @@
     "url": "https://leetcode.cn/problems/JEj789/",
     "path": "./problemset/paint-house/README.md"
   }
-]
+]

assets/docs/CATEGORIES.md

@@ -33,6 +33,7 @@
 | 290. [单词规律](../../problemset/word-pattern/README.md) | 简单 |
 | 355. [设计推特](../../problemset/design-twitter/README.md) | 中等 |
 | 380. [O(1) 时间插入、删除和获取随机元素](../../problemset/insert-delete-getrandom-o1/README.md) | 中等 |
+| 383. [赎金信](../../problemset/ransom-note/README.md) | 简单 |
 | 398. [随机数索引](../../problemset/random-pick-index/README.md) | 中等 |
 | 432. [全 O(1) 的数据结构](../../problemset/all-one-data-structure/README.md) | 困难 |
 | 532. [数组中的 k-diff 数对](../../problemset/k-diff-pairs-in-an-array/README.md) | 中等 |

assets/docs/TOPICS.md

@@ -542,6 +542,8 @@
 
 [380. O(1) 时间插入、删除和获取随机元素](../../problemset/insert-delete-getrandom-o1/README.md)
 
+[383. 赎金信](../../problemset/ransom-note/README.md)
+
 [385. 迷你语法分析器](../../problemset/mini-parser/README.md)
 
 [386. 字典序排数](../../problemset/lexicographical-numbers/README.md)

problemset/ransom-note/README.md

@@ -0,0 +1,64 @@
+# 赎金信
+
+> 简单
+>
+> https://leetcode.cn/problems/ransom-note/
+
+## 题目
+
+给你两个字符串：`ransomNote` 和 `magazine` ，判断 `ransomNote` 能不能由` magazine` 里面的字符构成。
+
+如果可以，返回 `true` ；否则返回 `false` 。
+
+`magazine` 中的每个字符只能在 `ransomNote` 中使用一次。
+
+### 示例
+
+#### 示例 1：
+
+```
+输入：ransomNote = "a", magazine = "b"
+输出：false
+```
+
+#### 示例 2：
+```
+输入：ransomNote = "aa", magazine = "ab"
+输出：false
+```
+
+#### 示例 3：
+
+```
+输入：ransomNote = "aa", magazine = "aab"
+输出：true
+```
+
+## 解题
+
+```ts 
+/**
+ * 哈希表
+ * @desc 时间复杂度 O(N + M)  空间复杂度 O(S)
+ * @param ransomNote
+ * @param magazine
+ * @returns
+ */
+export function canConstruct(ransomNote: string, magazine: string): boolean {
+  const map = new Map<string, number>()
+
+  for (const ch of magazine)
+    map.set(ch, (map.get(ch) || 0) + 1)
+
+  for (const ch of ransomNote) {
+    if (!map.has(ch))
+      return false
+    else if (map.get(ch) === 1)
+      map.delete(ch)
+    else
+      map.set(ch, map.get(ch)! - 1)
+  }
+
+  return true
+}
+```

problemset/ransom-note/index.spec.ts

@@ -0,0 +1,28 @@
+import { describe, expect, it } from 'vitest'
+import { canConstruct } from '.'
+
+describe('赎金信', () => {
+  testCase(canConstruct)
+})
+
+function testCase(fn: (ransomNote: string, magazine: string) => boolean) {
+  it.each([
+    [
+      'a',
+      'b',
+      false,
+    ],
+    [
+      'aa',
+      'ab',
+      false,
+    ],
+    [
+      'aa',
+      'aab',
+      true,
+    ],
+  ])('示例%#', (ransomNote, magazine, expected) => {
+    expect(fn(ransomNote, magazine)).toBe(expected)
+  })
+}

problemset/ransom-note/index.ts

@@ -0,0 +1,24 @@
+/**
+ * 哈希表
+ * @desc 时间复杂度 O(N + M)  空间复杂度 O(S)
+ * @param ransomNote
+ * @param magazine
+ * @returns
+ */
+export function canConstruct(ransomNote: string, magazine: string): boolean {
+  const map = new Map<string, number>()
+
+  for (const ch of magazine)
+    map.set(ch, (map.get(ch) || 0) + 1)
+
+  for (const ch of ransomNote) {
+    if (!map.has(ch))
+      return false
+    else if (map.get(ch) === 1)
+      map.delete(ch)
+    else
+      map.set(ch, map.get(ch)! - 1)
+  }
+
+  return true
+}