資料結構

If we use an array A0...N-1 to implement a circular queue, and use the variables front and rear, If the condition for a queue to be "empty" is front == rear, what is the condition for a queue to be "full"? (To distinguish between empty and full, one space is usually sacrificed.)