下面是用数组实现的循环队列(N=7,初始 front=rear=3)。依次执行 enqueue(10); enqueue(20); enqueue(30); dequeue(); enqueue(40); dequeue(); enqueue(50); 后,最终 (front, rear) 的值是( )。
const int N = 7;
int q[N];
int front = 3, rear = 3;
void enqueue(int x) { q[rear] = x; rear = (rear + 1) % N; }
void dequeue() { front = (front + 1) % N; }
- A. (5, 1)
- B. (4, 0)
- C. (5, 0)
- D. (3, 1)
正确答案：A