队列的顺序存储结构的一段代码有点不明白

<p>InsertQueue(cycleQueue *q,Elemtype e)<br >{<br >&nbsp; &nbsp;if((q-&gt;rear+1)%MAXSIZE==q-&gt;front)<br >&nbsp; &nbsp;&nbsp; &nbsp;&nbsp; &nbsp;&nbsp; &nbsp;&nbsp; &nbsp;&nbsp; &nbsp;return;//队列已满<br >&nbsp; &nbsp; q-&gt;base[q-&gt;rear]=e;<br >&nbsp; &nbsp; q-&gt;rear=(q-&gt;rear+1)%MAXSIZE<br >}</p><p><br >我认为应该把if((q-&gt;rear+1)%MAXSIZE==q-&gt;front)改为if((q-&gt;rear==q-&gt;front))才能判断队列是否已经满了<br ><br ></p>