First of all, we must be clear that the stack is first-in-last-out, and the queue is first-in-first-out. After this their respective characteristics, we use two stacks to implement a queue.
T
Tag: interview
[Data Structure] Stack Surface Test — Summary with O (1) Time Complexity
Assuming a set of numbers is given, we need to complete the minimum value of this set of numbers in O(1) time complexity Solve.
Specific description of the title: Define a stack, please imple
[Data Structure] Stack Surface Test – Two queues implement a stack
The last article wrote about using two stacks to implement a queue. This article implements using two queues to implement a stack. In fact, the ideas of both almost the same.
Continue drawing
[Data Structure] Stack Surface Test – A Array Realizing Two Stacks
One array to realize two stacks, there are several ways:
1. The odd-numbered positions of the array store the elements of one stack, and the even-numbered positions store the elements of th
[Data Structure] Big Data Processing Interview Solution
The idea of big data processing is generally like this: Divide a file that cannot fit in the memory into small files according to a certain method, and then see if there is a suitable data struct
ZooKeeper Interview Summary
1: What is Zookeeper?
Answer: ZooKeeper is an open source distributed coordination service. It is the manager of the cluster and monitors the feedback information of the cluster nodes for the