Introduction - If you have any usage issues, please Google them yourself
Circular couplet implementation,
//1. creates an empty loop queue that allocates space for the structure in the heap area
//2. determines whether the queue is empty
The //3. determines whether the queue is full
The //4. team, rear
//5. out, operation front