常用数据结构的插入、删除、读取

链表：
List<T> list = new ArrayList<>();
    add		remove	
    //list.add(value);  list.add(index,value);

双向链表
LinkedList<Integer> q = new LinkedList<>();
	q.addLast(n);	q.pollLast();	q.getLast()

栈
Deque<Integer> stack = new ArrayDeque<Integer>();
    push	pop		peek

双端队列
Deque<int[]> d = new ArrayDeque<>();
	addFirst 	addLast 	pollFirst	pollLast  peekFirst  peekLast 

单向队列：LIFO 
Queue<T> q = new LinkedList<>();
	push	pop   	peek

优先队列：
PriorityQueue<T> pq = new PriorityQueue<>();
    offer 	poll	peek


哈希表：
Map<T,T> map = new HashMap<>();
    put		remove  
    //remove(key);