Detailed explanation of Java custom implementation chain queue

1、 Write in front

The queue in the data structure should be familiar, that is, first in first out. It is named queue because it is orderly. It is like queuing. Insert a new node at the end and delete the node at the beginning The JDK collection framework also provides a queue interface This interface represents a queue Sequential queue: arrayblockingqueue, linkedblockingqueue (the above two are foot color queues) the other is concurrentlinkedqueue. The underlying implementation consists of array and linked list. The implementation of array will have a disadvantage, which will cause false fullness. At the beginning, when the queue is empty, the first and last reference variables are null. With the deletion of queue elements, front + 1 and rear are equal to the capacity of the underlying array In the sequential storage structure, front always stores the index of the elements in the queue that are about to leave the queue, and rear always stores the index of the elements that are about to enter the queue The number of elements in the queue is real front In the sequential queue, the bottom layer is an array, so the saved data elements will not change, only the two reference variables of rear and front Chained storage can make effective use of space, that is, reference variables take up additional space

Common operations of queue:

1: Initialization 2: return the length of the queue 3: add element 4: delete element 5: access the element at the beginning of the queue 6: access the element at the end of the queue 7: judge whether the queue is empty 8: empty the queue

2、 Custom implementation

The source code display is relatively clear, so there is no need to introduce more

Operation results:

The above is the whole content of this article. I hope it will be helpful to your study, and I hope you can support programming tips.