设队列头指针为front,队列尾指针为rear,队列容量为maxsize
(1)队空:front==rear;
(2)队满:(rear+1)mod maxsize==front(mod表示求余运算)
(3)队中元素个数:n=(rear-front+maxsize)mod maxsize;
(4)入队:rear=(rear+1)%maxsize;
(5)出队:front=(front+1)%maxsize;
设队列头指针为front,队列尾指针为rear,队列容量为maxsize
(1)队空:front==rear;
(2)队满:(rear+1)mod maxsize==front(mod表示求余运算)
(3)队中元素个数:n=(rear-front+maxsize)mod maxsize;
(4)入队:rear=(rear+1)%maxsize;
(5)出队:front=(front+1)%maxsize;