Linked List

Linked List #

  • 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
  • 灵活使用递归。构造递归条件,使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归,因为递归深度太深会导致超时和栈溢出。
  • 链表区间逆序。第 92 题。
  • 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
  • 合并 K 个有序链表。第 21 题,第 23 题。
  • 链表归类。第 86 题,第 328 题。
  • 链表排序,时间复杂度要求 O(n * log n),空间复杂度 O(1)。只有一种做法,归并排序,至顶向下归并。第 148 题。
  • 判断链表是否存在环,如果有环,输出环的交叉点的下标;判断 2 个链表是否有交叉点,如果有交叉点,输出交叉点。第 141 题,第 142 题,第 160 题。
TitleSolutionDifficultyTimeSpace收藏
2. Add Two NumbersGoMediumO(n)O(1)
19. Remove Nth Node From End of ListGoMediumO(n)O(1)
21. Merge Two Sorted ListsGoEasyO(log n)O(1)
23. Merge k Sorted ListsGoHardO(log n)O(1)❤️
24. Swap Nodes in PairsGoMediumO(n)O(1)
25. Reverse Nodes in k-GroupGoHardO(log n)O(1)❤️
61. Rotate ListGoMediumO(n)O(1)
82. Remove Duplicates from Sorted List IIGoMediumO(n)O(1)
83. Remove Duplicates from Sorted ListGoEasyO(n)O(1)
86. Partition ListGoMediumO(n)O(1)❤️
92. Reverse Linked List IIGoMediumO(n)O(1)❤️
109. Convert Sorted List to Binary Search TreeGoMediumO(log n)O(n)
141. Linked List CycleGoEasyO(n)O(1)❤️
142. Linked List Cycle IIGoMediumO(n)O(1)❤️
143. Reorder ListGoMediumO(n)O(1)❤️
147. Insertion Sort ListGoMediumO(n)O(1)❤️
148. Sort ListGoMediumO(n log n)O(n)❤️
160. Intersection of Two Linked ListsGoEasyO(n)O(1)❤️
203. Remove Linked List ElementsGoEasyO(n)O(1)
206. Reverse Linked ListGoEasyO(n)O(1)
234. Palindrome Linked ListGoEasyO(n)O(1)
237. Delete Node in a Linked ListGoEasyO(n)O(1)
328. Odd Even Linked ListGoMediumO(n)O(1)
445. Add Two Numbers IIGoMediumO(n)O(n)
725. Split Linked List in PartsGoMediumO(n)O(1)
817. Linked List ComponentsGoMediumO(n)O(1)
707. Design Linked ListGoEasyO(n)O(1)
876. Middle of the Linked ListGoEasyO(n)O(1)❤️
1019. Next Greater Node In Linked ListGoMediumO(n)O(1)
——————————————————————————————————–———————–———–——–

⬅️上一页

下一页➡️

Calendar Sep 6, 2020
Edit Edit this page
本站总访问量:  次 您是本站第  位访问者