# L8\_数据结构

**栈stack**

pee&#x6B;**,** pop, push

**堆heap**

peek, poll, offer

**Index**

**算中间有几条线段，可以直接i-j**

几个不同数据结构的基本get,contain时间复杂度

arraylist and linkedlist contains o(n)

set contains o(1)

[http://infotechgems.blogspot.com/2011/11/java-collections-performance-time.html](http://infotechgems.blogspot.com/2011/11/java-collections-performance-time.html)

Deque

就是双端链表
