dengbx的博客

1. Queue 用collections.deque实现 double linked list queue = collections.deque([]) queue.append(0) //O(1) queue.popleft() //O(1) 2. Stack 用list就可以实现。。  

Time complexity topmax/topmin O(1) push O(logn) Pop O(logn)   Remove (Java) Priority Queue: O(n) (traverse O(n) + swap O(1) + sift up/down O(logn)) Hash Heap: O(logn) (traverse O(1) + swap O(1)...