mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 17:44:10 +08:00
7.1 KiB
7.1 KiB
| title | type | weight |
|---|---|---|
| 2.04 ✅ Linked List | docs | 4 |
Linked List
- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
- 链表区间逆序。第 92 题。
- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
- 合并 K 个有序链表。第 21 题，第 23 题。
- 链表归类。第 86 题，第 328 题。
- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity | Favorite | Acceptance |
|---|---|---|---|---|---|---|---|
| 0002 | Add Two Numbers | [Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}}) | Medium | O(n) | O(1) | 37.2% | |
| 0019 | Remove Nth Node From End of List | [Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}}) | Medium | O(n) | O(1) | 37.2% | |
| 0021 | Merge Two Sorted Lists | [Go]({{< relref "/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md" >}}) | Easy | O(log n) | O(1) | 58.3% | |
| 0023 | Merge k Sorted Lists | [Go]({{< relref "/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md" >}}) | Hard | O(log n) | O(1) | ❤️ | 45.0% |
| 0024 | Swap Nodes in Pairs | [Go]({{< relref "/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md" >}}) | Medium | O(n) | O(1) | 56.0% | |
| 0025 | Reverse Nodes in k-Group | [Go]({{< relref "/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md" >}}) | Hard | O(log n) | O(1) | ❤️ | 48.8% |
| 0061 | Rotate List | [Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}}) | Medium | O(n) | O(1) | 33.1% | |
| 0082 | Remove Duplicates from Sorted List II | [Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}}) | Medium | O(n) | O(1) | 41.3% | |
| 0083 | Remove Duplicates from Sorted List | [Go]({{< relref "/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md" >}}) | Easy | O(n) | O(1) | 47.9% | |
| 0086 | Partition List | [Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}}) | Medium | O(n) | O(1) | ❤️ | 46.6% |
| 0092 | Reverse Linked List II | [Go]({{< relref "/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md" >}}) | Medium | O(n) | O(1) | ❤️ | 42.5% |
| 0109 | Convert Sorted List to Binary Search Tree | [Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}}) | Medium | O(log n) | O(n) | 53.9% | |
| 0114 | Flatten Binary Tree to Linked List | [Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}}) | Medium | 55.7% | |||
| 0138 | Copy List with Random Pointer | [Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}}) | Medium | 44.6% | |||
| 0141 | Linked List Cycle | [Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}}) | Easy | O(n) | O(1) | ❤️ | 44.3% |
| 0142 | Linked List Cycle II | [Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}}) | Medium | O(n) | O(1) | ❤️ | 41.9% |
| 0143 | Reorder List | [Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}}) | Medium | O(n) | O(1) | ❤️ | 44.1% |
| 0146 | LRU Cache | [Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}}) | Medium | 38.4% | |||
| 0147 | Insertion Sort List | [Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}}) | Medium | O(n) | O(1) | ❤️ | 46.2% |
| 0148 | Sort List | [Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}}) | Medium | O(n log n) | O(n) | ❤️ | 49.0% |
| 0160 | Intersection of Two Linked Lists | [Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}}) | Easy | O(n) | O(1) | ❤️ | 47.5% |
| 0203 | Remove Linked List Elements | [Go]({{< relref "/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md" >}}) | Easy | O(n) | O(1) | 41.3% | |
| 0206 | Reverse Linked List | [Go]({{< relref "/ChapterFour/0200~0299/0206.Reverse-Linked-List.md" >}}) | Easy | O(n) | O(1) | 68.3% | |
| 0234 | Palindrome Linked List | [Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}}) | Easy | O(n) | O(1) | 44.6% | |
| 0237 | Delete Node in a Linked List | [Go]({{< relref "/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md" >}}) | Easy | O(n) | O(1) | 70.0% | |
| 0328 | Odd Even Linked List | [Go]({{< relref "/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md" >}}) | Medium | O(n) | O(1) | 58.3% | |
| 0445 | Add Two Numbers II | [Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}}) | Medium | O(n) | O(n) | 57.8% | |
| 0460 | LFU Cache | [Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}}) | Hard | 38.4% | |||
| 0622 | Design Circular Queue | [Go]({{< relref "/ChapterFour/0600~0699/0622.Design-Circular-Queue.md" >}}) | Medium | 48.1% | |||
| 0705 | Design HashSet | [Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}}) | Easy | 63.8% | |||
| 0706 | Design HashMap | [Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}}) | Easy | 63.8% | |||
| 0707 | Design Linked List | [Go]({{< relref "/ChapterFour/0700~0799/0707.Design-Linked-List.md" >}}) | Medium | O(n) | O(1) | 26.5% | |
| 0725 | Split Linked List in Parts | [Go]({{< relref "/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md" >}}) | Medium | O(n) | O(1) | 56.2% | |
| 0817 | Linked List Components | [Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}}) | Medium | O(n) | O(1) | 57.9% | |
| 0876 | Middle of the Linked List | [Go]({{< relref "/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md" >}}) | Easy | O(n) | O(1) | ❤️ | 70.7% |
| 1019 | Next Greater Node In Linked List | [Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}}) | Medium | O(n) | O(1) | 59.3% | |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | [Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}}) | Medium | 42.0% | |||
| 1290 | Convert Binary Number in a Linked List to Integer | [Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}}) | Easy | 81.8% | |||
| 1669 | Merge In Between Linked Lists | [Go]({{< relref "/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md" >}}) | Medium | 74.9% | |||
| 1670 | Design Front Middle Back Queue | [Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}}) | Medium | 54.9% | |||
| 1721 | Swapping Nodes in a Linked List | [Go]({{< relref "/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md" >}}) | Medium | 66.0% | |||
| ------------ | ------------------------------------------------------- | ------- | ---------------- | --------------- | ------------- | ------------- | ------------- |