#include<stdio.h>
#include<stdlib.h>
typedef struct Node
{
int data;
struct Node *next;
}NodeQueue;
typedef struct Link
{
NodeQueue *front;
NodeQueue *rear;
}LinkQueue;
LinkQueue* CreatLinkQueue()
{
LinkQueue *Q=(LinkQueue*)malloc(sizeof(LinkQueue));
Q->front=(NodeQueue*)malloc(sizeof(NodeQueue));
if(Q->front == NULL)
{
printf("Oh no!");
exit(1);
}
if(Q!=NULL)
{
Q->rear=Q->front;
Q->front->next=NULL;

return Q;
}

else
return NULL;
}
void EnterQueue(LinkQueue *Q)
{
int c,flag;
NodeQueue *node;
printf("进队\n");
while(flag)
{
scanf("%d",&c);
if(c!=0)
{
node=(NodeQueue*)malloc(sizeof(NodeQueue));
node->data=c;
node->next=NULL;
Q->rear->next=node;
Q->rear=node;
flag=1;

}

else
flag=0;
}

}
int DeleteQueue(LinkQueue *Q)
{
LinkQueue *q;
NodeQueue*p;
if(Q->front==Q->rear)
return 0;
q=Q;
while(q->front->next!=NULL)
{
p=q->front;
q->front=q->front->next;
printf("\n%d",q->front->data);
free(p);
}
return 1;
}
int main()
{
LinkQueue *Q;
Q=CreatLinkQueue();
EnterQueue(Q);
DeleteQueue(Q);
return 0;
}