queue::queue( ) //build an empty queue{ front=0; rear=0;}bool queue::empty( ) const{ return rear==front; } (rear+1) % maxqueue==front;为判别队列满的条件即答案选择A
明显是A
