设循环队列的结构是: const int Maxsize=100; typedef int Data Type; typedef struct { Data Type data[Maxsize]; int front, rear; } Queue; 若有一个Queue类型的队列Q,试问判断队列满的条件应是下列哪一个语句
Q.front= = (Q.rear+1)% Maxsize;
Q.front= = Q.rear;
Q.front - Q.rear= = Maxsize;
Q.front + Q.rear= = Maxsize;