双向循环队列（国外英文资料）.docVIP

双向循环队列（国外英文资料） A two-way loop queue. TXT is a smoke that is lonely... Its not that you dont laugh. People are not smart, and they learn to be bald. Dont say my heart doesnt hold my heart! No, no, no, no, no, no, no, no! Be happy when you are alive, because we will die long. Please dont speak English in front of me, OK? # include iostream # include cstrings # # ifndef DataType # define DataType int # endif # # ifndef MaxSize # define MaxSize 5 # endif Typedef struct { DataType list [MaxSize]; Int the front; / / head pointer Int rear; / / tail pointer } BSeqCQueue; Int in_queue (BSeqCQueue * q, DataType * d) { If ((q- rear + 1) % MaxSize! = q- front) {. Q- list. So q minus , thats the same thing as q minus . Return 0; } The else return 1; } Int out_queue (BSeqCQueue * q, DataType * d) { If (q- front! = q- rear) { * d = q- list [q- front]; Q minus front = (q- front + 1). Return 0; } Return 1; } Int main () { BSeqCQueue * Q = new (BSeqCQueue); Memset (Q, 0, sizeof (* Q)); / / initialization is sometimes called q-, which is the same thing as Q - front = 0, Int I; For (I = 0; I 6; I + +) { If (in_queue (Q, i)! = 0) { STD: : cout Error in_queue \ n; } } DataType d; For (I = 0; I 6; I + +) { If ((out_queue (Q, d) = = 0) STD: : cout. } The else { STD: : cout Error out_queue \ n; } } One, circular queue structure When the linear queue is converted into a loop queue, the formula for the rear + 1 is converted to (rear + 1) mod maxq. When you delete the data, the formula for front + 1 is converted to (front + 1) mod maxq. The array of the storage queue is treated as the first tail. The head of the team, the tail pointer of the team is added 1 from maxq directly to 1, and the module of the available language (remainder) is implemented. The head of the team entered 1: front = (front + 1) mod maxq; The tail arm of the team goes to 1: rear + 1 mod maxq. Queue initialization: front = rear = 0; : front = rear; (rear + 1) mod maxq = = front 2. # include iostream. H # inc