友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

微信

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

List 链表

套路

前缀和

详情见 Prefix Sum 前缀和

差分数组

详情见 Difference Array 差分数组

单调栈

详情见 Monotonic Stack 单调栈

其他技巧

  1. 将链表做成环，比如 61. Rotate List。

经典题目

  1. 2. Add Two Numbers

  2. 19. 删除链表的倒数第 N 个结点

  3. 21. 合并两个有序链表

  4. 23. 合并 K 个升序链表

  5. 24. Swap Nodes in Pairs

  6. 25. K 个一组翻转链表

  7. 61. Rotate List

  8. 82. Remove Duplicates from Sorted List II

  9. 83. Remove Duplicates from Sorted List

  10. 86. Partition List

  11. 92. 反转链表 II

  12. 109. 有序链表转换二叉搜索树

  13. 114. Flatten Binary Tree to Linked List

  14. 116. Populating Next Right Pointers in Each Node

  15. 117. Populating Next Right Pointers in Each Node II

  16. 138. Copy List with Random Pointer

  17. 141. 环形链表

  18. 142. 环形链表 II

  19. 143. 重排链表

  20. 146. LRU 缓存

  21. [0147-insertion-sort-list]

  22. 148. 排序链表

  23. 160. Intersection of Two Linked Lists

  24. 203. 移除链表元素

  25. 206. 反转链表

  26. 234. Palindrome Linked List

  27. 237. Delete Node in a Linked List

  28. 328. Odd Even Linked List

  29. [0355-design-twitter]

  30. [0369-plus-one-linked-list]

  31. [0379-design-phone-directory]

  32. [0382-linked-list-random-node]

  33. [0426-convert-binary-search-tree-to-sorted-doubly-linked-list]

  34. [0430-flatten-a-multilevel-doubly-linked-list]

  35. [0432-all-oone-data-structure]

  36. [0445-add-two-numbers-ii]

  37. [0460-lfu-cache]

  38. [0622-design-circular-queue]

  39. [0641-design-circular-deque]

  40. [0705-design-hashset]

  41. [0706-design-hashmap]

  42. 707. 设计链表

  43. [0708-insert-into-a-sorted-circular-linked-list]

  44. [0716-max-stack]

  45. [0725-split-linked-list-in-parts]

  46. [0817-linked-list-components]

  47. 876. Middle of the Linked List

  48. [1019-next-greater-node-in-linked-list]

  49. [1171-remove-zero-sum-consecutive-nodes-from-linked-list]

  50. [1206-design-skiplist]

  51. [1265-print-immutable-linked-list-in-reverse]

  52. [1290-convert-binary-number-in-a-linked-list-to-integer]

  53. [1367-linked-list-in-binary-tree]

  54. [1472-design-browser-history]

  55. [1474-delete-n-nodes-after-m-nodes-of-a-linked-list]

  56. [1634-add-two-polynomials-represented-as-linked-lists]

  57. [1669-merge-in-between-linked-lists]

  58. [1670-design-front-middle-back-queue]

  59. [1721-swapping-nodes-in-a-linked-list]

  60. [1797-design-authentication-manager]

  61. [1836-remove-duplicates-from-an-unsorted-linked-list]

  62. [2046-sort-linked-list-already-sorted-using-absolute-values]

  63. [2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points]

  64. [2074-reverse-nodes-in-even-length-groups]

  65. [2095-delete-the-middle-node-of-a-linked-list]

  66. [2130-maximum-twin-sum-of-a-linked-list]

  67. [2181-merge-nodes-in-between-zeros]

  68. [2289-steps-to-make-array-non-decreasing]

  69. [2296-design-a-text-editor]

  70. [2326-spiral-matrix-iv]

  71. [2487-remove-nodes-from-linked-list]

  72. [2674-split-a-circular-linked-list]

  73. [2807-insert-greatest-common-divisors-in-linked-list]

  74. [2816-double-a-number-represented-as-a-linked-list]

  75. [3062-winner-of-the-linked-list-game]

  76. [3063-linked-list-frequency]

  77. [3217-delete-nodes-from-linked-list-present-in-array]

  78. [3263-convert-doubly-linked-list-to-array-i]

  79. [3294-convert-doubly-linked-list-to-array-ii]

  80. [3507-minimum-pair-removal-to-sort-array-i]

  81. [3510-minimum-pair-removal-to-sort-array-ii]

参考资料

  1. 303. 区域和检索 - 数组不可变 - 简单问题细致分析，『前缀和』优化了什么

  2. 1109. 航班预订统计 - 【宫水三叶】一题双解 :「差分」&「线段树」（附区间求和目录）

← Previous: 总览 | ↑ Up: LeetCode 解题笔记 | Next: Stack 栈 →