王道数据结构第三章

//队列的顺序实现
#define maxsize 50
typedef struct 
{
	Elemtype data[maxsize];
	int front,rear;
}SqQueue;
SqQueue s;
bool isEmpty(SqQueue &q)
{
	if(q.rear==q.front)
		return true;
	else 
		return false;
}
bool EnQueue(SqQueue &q,Elemtype x)
{
	if((q.rear+1)%maxsize==q.front) return false;
	q.data[q.rear]=x;
	q.rear=(q.rear+1)%maxsize;
	return true;
}
bool DeQueue(SqQueue &q,Elemtype &x)
{
	if(q.rear==q.front) return false;
	x=q.data[q.front];
	q.front=(q.front+1)%maxsize;
	return true;
}

//链式队列
typedef struct 
{
	Elemtype data;
	struct linknode *next;
}linknode;
typedef struct 
{
	linknode *front,*rear;
}linkqueue;
void initqueue(linkqueue &q)
{
	q.front=q.rear=(linknode*)malloc(sizeof(linknode));
	q.front->next=NULL;
}
bool isEmpty(linkqueue q)
{
	if(q.front==q.rear) return true;
	else return false;
}
bool EnQueue(linkqueue &q,Elemtype x);
{
	linknode *s=(linknode *)malloc(sizeof(linknode));
	s->data=x;
	s->next=NULL;
	q.rear->next=s;
	q.rear=s;
}
bool DeQueue(linkqueue &q,Elemtype &x)
{
	if(q.front==q.rear) return false;
	Linklist *s=q.front->next;
	x=s.data;
	q.front->next=x->next;
	if(q.rear==x)
		q.rear=q.front;
	free(x);
	return true;
}

//1
typedef struct 
{
	Elemtype data[maxsize];
	int tag;
	int front,rear;
}SqQueue;
bool EnQueue(SqQueue &q,Elemtype x)
{
	if(q.rear==q.front&&q.tag==1) return false;
	q.data[q.rear++]=x;
	q.rear=(q.rear+1)%maxsize;
	tag=1;
	return true;
}
bool DeQueue(SqQueue &q,Elemtype &x)
{
	if(q.front==q.rear&&q.tag==0) return false;
	x=q.data[q.front];
	q.front=(q.front+1)&maxsize;
	tag=0;
	return true;
}

//2
void Inverser(stack S,SqQueue q)
{
	while(!isEmpty(q))
	{
		x=DeQueue(q);
		push(S,x);
	}
	while(!stackempty(S))
	{
		pop(S,x);
		EnQueue(q,x);
	}
}

//3