定长数组实现队列

#include<iostream>
#define SIZE 100;
using namespace std;

class Queue
{
private:
	int arr[SIZE];
	int head;
	int tail;
public:
	Queue()
	{
		head=0;
		tail=0;
	}
	bool isFull()
	{
		return (tail+1)% SIZE==head;
	}
	bool isEmpty()
	{
		return head==tail;
	}
	void enqueue(int val)
	{
		if(isFull()) 
		{
			cout<<"Full"<<endl;
			return;
		}
		arr[tail]=val;
		tail=(tail+1)%SIZE;
	}
	int dequeue()
	{
		if(isEmpty())
		{
			cout<<"Empty"<<endl;
			return -1;
		}
		int val=arr[head];
		head=(head+1)%SIZE;
		return val;
	}	
}