C++ 队列类实现：enqueue、dequeue、isEmpty、isFull

class Queue { private: int* arr; int front; int rear; int capacity; public: Queue(int size) { arr = new int[size]; capacity = size; front = 0; rear = -1; } ~Queue() { delete[] arr; } void enqueue(int val) { if(isFull()) { cout << 'Queue is full.' << endl; return; } rear++; arr[rear] = val; } int dequeue() { if(isEmpty()) { cout << 'Queue is empty.' << endl; return -1; } int val = arr[front]; front++; return val; } bool isEmpty() { return (rear < front); } bool isFull() { return (rear == capacity - 1); } };