自写的队列的一些基本处理

#include<iostream>
using namespace std;
#define MAXSIZE 5
struct Queue{
	int array[MAXSIZE];
	int front,rear;
};
typedef Queue QUEUE;
QUEUE* init()
{
	QUEUE* squeue=(QUEUE*)malloc(sizeof(QUEUE));
	squeue->front=squeue->rear=0;
	return squeue;
}
int inq(QUEUE* sq,int x)
{
	if((sq->rear+1)%MAXSIZE==sq->front)
		return -1;
	sq->rear=(sq->rear+1)%MAXSIZE;
	sq->array[sq->rear]=x;
	return 1;
}
int outq(QUEUE* sq)
{
	if(sq->rear==sq->front)
	{
		cout<<"null，无法提出元素"<<endl;
		return -1;
	}
	sq->front=(sq->front+1)%MAXSIZE;
	return sq->array[sq->front];
}
int size(QUEUE* sq)
{
	return (sq->rear-sq->front+MAXSIZE)%MAXSIZE;
}
void display(QUEUE* sq)
{
	if(sq->rear==sq->front)
	{
		cout<<"null、、、"<<endl;
		return;
	}
	cout<<"左头右尾："<<endl;
	for(int i=sq->front+1;i!=(sq->rear+1)%MAXSIZE;i=(i+1)%MAXSIZE)
		cout<<sq->array[i]<<",";
	cout<<"size:"<<size(sq)<<endl;
}
int main()
{
	QUEUE* sq=init();
	for(int i=0;i<3;i++)
		inq(sq,i+10);
	display(sq);
	if(inq(sq,20)!=-1)
	{
		cout<<"新加入了一个元素20"<<endl;
		display(sq);
	}
	else
		cout<<"error! full"<<endl;
	if(inq(sq,30)!=-1)
	{
		cout<<"新加入了一个元素30"<<endl;
		display(sq);
	}
	else
		cout<<"error! full"<<endl;
	cout<<"不断删除元素直到空为止！"<<endl;
	int x;
	while(x!=-1){
	x=outq(sq);
	if(x==-1) break;
	cout<<"出队一个："<<x<<endl;
	display(sq);
	}
	return 0;
}