https://blog.csdn.net/u011080472/article/details/51173584
设front为队首指针,rear为队尾指针,m为队列最大容量。
入队: rear = (rear + 1) % m
出队: front = (front + 1) % m
队空: front = rear
队满: front = (rear + 1) % m
当前队列中的元素数目:
n = (rear - front + m) % m
本文来自 smile4lee 的CSDN 博客 ,全文地址请点击:https://blog.csdn.net/u011080472/article/details/51173584?utm_source=copy