#include<cstdio>
#include<cstdlib>
#define ERROR 0
#define OK 1
typedef struct QNode{
int data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct {
QueuePtr front;
QueuePtr rear;
}LinkQueue;
//建立空单链队列
int InitQueueLinkQueue(LinkQueue &Q){
Q.front = Q.rear = (QueuePtr)malloc(sizeof(QNode));
if(!Q.front)
return ERROR;
Q.front->next=NULL;
return OK;
}
//插入元素
int EnQueue(LinkQueue &Q,int e){
QueuePtr p;
p = (QueuePtr)malloc(sizeof(QNode)); //插入元素e为Q的新的队尾元素
if(!p)
return ERROR;
p->data=e;
p->next=NULL;
Q.rear->next=p;
Q.rear=p;
return OK;
}
//删除元素
int DeQueue(LinkQueue &Q){
int m;
QueuePtr p;
if(Q.front == Q.rear)
return ERROR;
p=Q.front->next;
m=p->data;
Q.front->next=p->next;
if(Q.rear==p)
Q.rear=Q.front;
free(p);
return m;
}
int main()
{
LinkQueue Q;
InitQueueLinkQueue(Q);
int n,m;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
EnQueue(Q,a[i]);
}
for(int i=0;i<n;i++)
{
m=DeQueue(Q);
printf("%d ",m);
}
return 0;
}
#include<cstdlib>
#define ERROR 0
#define OK 1
typedef struct QNode{
int data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct {
QueuePtr front;
QueuePtr rear;
}LinkQueue;
//建立空单链队列
int InitQueueLinkQueue(LinkQueue &Q){
Q.front = Q.rear = (QueuePtr)malloc(sizeof(QNode));
if(!Q.front)
return ERROR;
Q.front->next=NULL;
return OK;
}
//插入元素
int EnQueue(LinkQueue &Q,int e){
QueuePtr p;
p = (QueuePtr)malloc(sizeof(QNode)); //插入元素e为Q的新的队尾元素
if(!p)
return ERROR;
p->data=e;
p->next=NULL;
Q.rear->next=p;
Q.rear=p;
return OK;
}
//删除元素
int DeQueue(LinkQueue &Q){
int m;
QueuePtr p;
if(Q.front == Q.rear)
return ERROR;
p=Q.front->next;
m=p->data;
Q.front->next=p->next;
if(Q.rear==p)
Q.rear=Q.front;
free(p);
return m;
}
int main()
{
LinkQueue Q;
InitQueueLinkQueue(Q);
int n,m;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
EnQueue(Q,a[i]);
}
for(int i=0;i<n;i++)
{
m=DeQueue(Q);
printf("%d ",m);
}
return 0;
}