选择最频繁的操作成本最低的结构,以匹配你的访问模式。首先列出你将执行的操作,估计它们的频率,然后将它们与结构的优势相匹配。
决策清单
text
1. How do you access data? by index -> array
by key -> hash map
by order -> tree / heap
2. Need ordering? sorted -> balanced BST / sorted array
FIFO -> queue
LIFO -> stack
3. Frequent middle inserts? -> linked list
4. Need fast "seen it?" -> set / hash map
5. Need "best/min/max next" -> heap (priority queue)
