Brush the topic reference

A, list

Linked lists: Single-linked lists Double-linked lists Round-robin lists usually use virtual head nodes, which are more convenient when dealing with head nodes. Double Pointers are often used in linked lists; Slow =slow. Next,fast=fast. Next;

Insert/delete/query time complexity comparison of arrays and linked lists

1. 🗡☞Offer35 Replication of complex linked listsAnswer key 1 Answer key 2

2. 203. Remove linked list elementsAnswer key

707. Design linked listsAnswer key

4. 206. Reverse linked listsAnswer key

5.19. Delete the NTH to last node of a linked list (single linked list)Answer key

6. 142. Circular list entryAnswer key

7. 21. Merge two ordered listsAnswer key

8. 160. Two lists intersect (Find common nodes of two lists)Answer key

9. 148. Time complexity required for Linked list sorting O(nlogn)Answer key 1

10. 141. Whether the linked list has ring judgment (similar to 6. 142.Answer key

11. 234. Palindrome list judgmentAnswer key

12. 146. LRU cache implementation (Hash + Bidirectional List)Answer key

13. 202. Happiness numberAnswer key

Queue and stack

1. 232. Implement queues with stacksAnswer key

2.225. Implement stacks with queuesAnswer key

3. 20. Matching parenthesesAnswer key

4. 1047. Delete all repeated adjacent items in the stringAnswer key

5.150. Evaluation of the inverse Polish expressionAnswer key

6. 239. Maximum sliding window valueAnswer key

7. 347. The first K high-frequency elementsAnswer key

8. 71. Simplify pathsAnswer key