## 链表

| \# | 题名 | 题解 | 通过率 | 难度 | 出现频率   |
|------|----------------------|-----|--------|----|--------|
|206|[反转链表](https://leetcode-cn.com/problems/reverse-linked-list)   |[236](https://leetcode-cn.com/problems/reverse-linked-list/solution)|66.0%|简单|67.63%|
|2|[两数相加](https://leetcode-cn.com/problems/add-two-numbers)   |[713](https://leetcode-cn.com/problems/add-two-numbers/solution)|36.2%|中等|59.99%|
|25|[K 个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group)   |[172](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/solution)|55.3%|困难|52.97%|
|21|[合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists)   |[254](https://leetcode-cn.com/problems/merge-two-sorted-lists/solution)|58.8%|简单|52.47%|
|23|[合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists)   |[170](https://leetcode-cn.com/problems/merge-k-sorted-lists/solution)|48.2%|困难|52.35%|
|426|[将二叉搜索树转化为排序的双向链表](https://leetcode-cn.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list)   |[16](https://leetcode-cn.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/solution)|57.6%|中等|51.37%|
|92|[反转链表 II](https://leetcode-cn.com/problems/reverse-linked-list-ii)   |[141](https://leetcode-cn.com/problems/reverse-linked-list-ii/solution)|48.3%|中等|50.62%|
|148|[排序链表](https://leetcode-cn.com/problems/sort-list)   |[95](https://leetcode-cn.com/problems/sort-list/solution)|62.7%|中等|47.13%|
|445|[两数相加 II](https://leetcode-cn.com/problems/add-two-numbers-ii)   |[60](https://leetcode-cn.com/problems/add-two-numbers-ii/solution)|52.5%|中等|46.05%|
|143|[重排链表](https://leetcode-cn.com/problems/reorder-list)   |[69](https://leetcode-cn.com/problems/reorder-list/solution)|53.8%|中等|41.38%|
|19|[删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list)   |[307](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution)|36.8%|中等|41.29%|
|86|[分隔链表](https://leetcode-cn.com/problems/partition-list)   |[85](https://leetcode-cn.com/problems/partition-list/solution)|54.4%|中等|37.75%|
|138|[复制带随机指针的链表](https://leetcode-cn.com/problems/copy-list-with-random-pointer)   |[42](https://leetcode-cn.com/problems/copy-list-with-random-pointer/solution)|41.1%|中等|35.84%|
|203|[移除链表元素](https://leetcode-cn.com/problems/remove-linked-list-elements)   |[145](https://leetcode-cn.com/problems/remove-linked-list-elements/solution)|43.2%|简单|33.02%|
|82|[删除排序链表中的重复元素 II](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii)   |[129](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/solution)|44.8%|中等|32.37%|
|141|[环形链表](https://leetcode-cn.com/problems/linked-list-cycle)   |[168](https://leetcode-cn.com/problems/linked-list-cycle/solution)|45.1%|简单|31.31%|
|234|[回文链表](https://leetcode-cn.com/problems/palindrome-linked-list)   |[170](https://leetcode-cn.com/problems/palindrome-linked-list/solution)|39.5%|简单|29.81%|
|876|[链表的中间结点](https://leetcode-cn.com/problems/middle-of-the-linked-list)   |[76](https://leetcode-cn.com/problems/middle-of-the-linked-list/solution)|63.5%|简单|28.19%|
|24|[两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs)   |[240](https://leetcode-cn.com/problems/swap-nodes-in-pairs/solution)|63.4%|中等|28.09%|
|61|[旋转链表](https://leetcode-cn.com/problems/rotate-list)   |[148](https://leetcode-cn.com/problems/rotate-list/solution)|39.6%|中等|27.69%|
|147|[对链表进行插入排序](https://leetcode-cn.com/problems/insertion-sort-list)   |[53](https://leetcode-cn.com/problems/insertion-sort-list/solution)|61.8%|中等|26.74%|
|379|[电话目录管理系统](https://leetcode-cn.com/problems/design-phone-directory)   |[12](https://leetcode-cn.com/problems/design-phone-directory/solution)|65.9%|中等|24.83%|
|83|[删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list)   |[119](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/solution)|48.4%|简单|24.7%|
|160|[相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists)   |[132](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/solution)|50.9%|简单|24.14%|
|328|[奇偶链表](https://leetcode-cn.com/problems/odd-even-linked-list)   |[62](https://leetcode-cn.com/problems/odd-even-linked-list/solution)|60.3%|中等|23.19%|
|142|[环形链表 II](https://leetcode-cn.com/problems/linked-list-cycle-ii)   |[106](https://leetcode-cn.com/problems/linked-list-cycle-ii/solution)|46.8%|中等|22.26%|
|707|[设计链表](https://leetcode-cn.com/problems/design-linked-list)   |[51](https://leetcode-cn.com/problems/design-linked-list/solution)|23.6%|中等|21.22%|
|1171|[从链表中删去总和值为零的连续节点](https://leetcode-cn.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list)   |[30](https://leetcode-cn.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/solution)|34.3%|中等|21.06%|
|109|[有序链表转换二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree)   |[43](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree/solution)|69.5%|中等|20.9%|
|725|[分隔链表](https://leetcode-cn.com/problems/split-linked-list-in-parts)   |[33](https://leetcode-cn.com/problems/split-linked-list-in-parts/solution)|52.0%|中等|20.25%|
|369|[给单链表加一](https://leetcode-cn.com/problems/plus-one-linked-list)   |[16](https://leetcode-cn.com/problems/plus-one-linked-list/solution)|58.4%|中等|20.21%|
|237|[删除链表中的节点](https://leetcode-cn.com/problems/delete-node-in-a-linked-list)   |[105](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/solution)|79.0%|简单|19.34%|
|817|[链表组件](https://leetcode-cn.com/problems/linked-list-components)   |[21](https://leetcode-cn.com/problems/linked-list-components/solution)|55.2%|中等|17.49%|
|430|[扁平化多级双向链表](https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list)   |[30](https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list/solution)|44.1%|中等|13.05%|
|1019|[链表中的下一个更大节点](https://leetcode-cn.com/problems/next-greater-node-in-linked-list)   |[23](https://leetcode-cn.com/problems/next-greater-node-in-linked-list/solution)|48.7%|中等|7.12%|
|1290|[二进制链表转整数](https://leetcode-cn.com/problems/convert-binary-number-in-a-linked-list-to-integer)   |[57](https://leetcode-cn.com/problems/convert-binary-number-in-a-linked-list-to-integer/solution)|79.8%|简单|&nbsp;|
|708|[循环有序列表的插入](https://leetcode-cn.com/problems/insert-into-a-sorted-circular-linked-list)   |[5](https://leetcode-cn.com/problems/insert-into-a-sorted-circular-linked-list/solution)|28.0%|中等|&nbsp;|
