feat: leetcode 817

Author: deweyou

README.md

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

@@ -2333,6 +2333,12 @@
         "path": "./problemset/number-of-lines-to-write-string/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "817",
+        "title": "链表组件",
+        "path": "./problemset/linked-list-components/README.md",
+        "difficulty": "中等"
+      },
       {
         "id": "821",
         "title": "字符的最短距离",

assets/data/topics.json

@@ -3859,6 +3859,16 @@
     "url": "https://leetcode.cn/problems/binary-tree-pruning/",
     "path": "./problemset/binary-tree-pruning/README.md"
   },
+  {
+    "id": "817",
+    "title": {
+      "cn": "链表组件",
+      "en": "linked-list-components"
+    },
+    "difficulty": "中等",
+    "url": "https://leetcode.cn/problems/linked-list-components/",
+    "path": "./problemset/linked-list-components/README.md"
+  },
   {
     "id": "819",
     "title": {

assets/docs/CATEGORIES.md

@@ -430,6 +430,7 @@
 | 796. [旋转字符串](../../problemset/rotate-string/README.md) | 简单 |
 | 798. [得分最高的最小轮调](../../problemset/smallest-rotation-with-highest-score/README.md) | 困难 |
 | 806. [写字符串需要的行数](../../problemset/number-of-lines-to-write-string/README.md) | 简单 |
+| 817. [链表组件](../../problemset/linked-list-components/README.md) | 中等 |
 | 821. [字符的最短距离](../../problemset/shortest-distance-to-a-character/README.md) | 简单 |
 | 824. [山羊拉丁文](../../problemset/goat-latin/README.md) | 简单 |
 | 827. [最大人工岛](../../problemset/making-a-large-island/README.md) | 困难 |

assets/docs/TOPICS.md

@@ -772,6 +772,8 @@
 
 [814. 二叉树剪枝](../../problemset/binary-tree-pruning/README.md)
 
+[817. 链表组件](../../problemset/linked-list-components/README.md)
+
 [819. 最常见的单词](../../problemset/most-common-word/README.md)
 
 [821. 字符的最短距离](../../problemset/shortest-distance-to-a-character/README.md)

problemset/linked-list-components/README.md

@@ -0,0 +1,68 @@
+# 链表组件
+
+> 难度：中等
+>
+> https://leetcode.cn/problems/linked-list-components/
+
+## 题目
+
+给定链表头结点 head，该链表上的每个结点都有一个 唯一的整型值 。同时给定列表 nums，该列表是上述链表中整型值的一个子集。
+
+返回列表 nums 中组件的个数，这里对组件的定义为：链表中一段最长连续结点的值（该值必须在列表 nums 中）构成的集合。
+
+ 
+
+#### 示例 1：
+
+![image](https://user-images.githubusercontent.com/54696834/195327308-9cd30480-b7c0-4c5d-bc13-24cfd0b8a93f.png)
+
+```
+输入: head = [0,1,2,3], nums = [0,1,3]
+输出: 2
+解释: 链表中,0 和 1 是相连接的，且 nums 中不包含 2，所以 [0, 1] 是 nums 的一个组件，同理 [3] 也是一个组件，故返回 2。
+```
+
+#### 示例 2：
+
+![image](https://user-images.githubusercontent.com/54696834/195327359-32946af2-6e12-4133-8b80-fab2a9b0d3d3.png)
+
+
+输入: head = [0,1,2,3,4], nums = [0,3,1,4]
+输出: 2
+解释: 链表中，0 和 1 是相连接的，3 和 4 是相连接的，所以 [0, 1] 和 [3, 4] 是两个组件，故返回 2。
+
+
+## 解题
+
+```ts 
+import type { ListNode } from '~/utils/listNode'
+
+/**
+ * 计算组件的起始位置
+ * @desc 时间复杂度 O(N) 空间复杂度 O(M)
+ * @param head
+ * @param nums
+ * @returns
+ */
+export function numComponents(head: ListNode | null, nums: number[]): number {
+  const numsSet = new Set<number>()
+  for (const num of nums)
+    numsSet.add(num)
+
+  let inSet = false
+  let res = 0
+  while (head) {
+    if (numsSet.has(head.val)) {
+      if (!inSet) {
+        inSet = true
+        res++
+      }
+    }
+    else {
+      inSet = false
+    }
+    head = head.next
+  }
+  return res
+}
+```

problemset/linked-list-components/index.spec.ts

@@ -0,0 +1,25 @@
+import { describe, expect, it } from 'vitest'
+import { numComponents } from '.'
+import type { ListNode } from '~/utils/listNode'
+import { createListNode } from '~/utils/listNode'
+
+describe('链表组件', () => {
+  testCase(numComponents)
+})
+
+function testCase(fn: (head: ListNode | null, nums: number[]) => number) {
+  it.each([
+    [
+      [0, 1, 2, 3],
+      [0, 1, 3],
+      2,
+    ],
+    [
+      [0, 1, 2, 3, 4],
+      [0, 3, 1, 4],
+      2,
+    ],
+  ])('示例%#', (head, nums, expected) => {
+    expect(fn(createListNode(head), nums)).toBe(expected)
+  })
+}

problemset/linked-list-components/index.ts

@@ -0,0 +1,30 @@
+import type { ListNode } from '~/utils/listNode'
+
+/**
+ * 计算组件的起始位置
+ * @desc 时间复杂度 O(N) 空间复杂度 O(M)
+ * @param head
+ * @param nums
+ * @returns
+ */
+export function numComponents(head: ListNode | null, nums: number[]): number {
+  const numsSet = new Set<number>()
+  for (const num of nums)
+    numsSet.add(num)
+
+  let inSet = false
+  let res = 0
+  while (head) {
+    if (numsSet.has(head.val)) {
+      if (!inSet) {
+        inSet = true
+        res++
+      }
+    }
+    else {
+      inSet = false
+    }
+    head = head.next
+  }
+  return res
+}