📒
SDE Interview Guide
  • 前言:用“模式识别”来解决SDE面试问题的方法学
  • 1. Array - Sliding Window
  • 2. Array - Intervals
  • Chapter 1: Collections
  • Chapter 2: Linked List
  • Chapter 3: Stacks, Queues and Heap
  • Chapter 4: Trees and Graph
  • Chapter 5: Recursion and Dynamic Programming
  • Chapter 6: Sorting and Searching
  • Chapter 7: Miscellaneous
  • Chapter 8: System Design
  • Chapter 9: Mathematics
Powered by GitBook
On this page

Was this helpful?

Chapter 3: Stacks, Queues and Heap

当排列的优先级就是时间顺序时,那么Priority Queue即heap就坍塌成Queue,因为Queue一定保证后插入的就会在最后面。

PreviousChapter 2: Linked ListNextChapter 4: Trees and Graph

Last updated 4 years ago

Was this helpful?