注意不设头指针,注意细节!!!
#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
int a;
struct node *next;
}node,*link;
typedef struct
{
link rear;
}Link;
void Push(Link &Q,int n)
{
while(n--)
{
node *p=new node;
scanf("%d",&p->a);
p->next=Q.rear->next;
Q.rear->next=p;
Q.rear=p;
}
}
void Pop(Link &Q,int m)
{
while(m--)
{
node *p=Q.rear->next->next;
printf("%d ",p->a);
if(p==Q.rear)
{
Q.rear=Q.rear->next;
Q.rear->next=p->next;
}
else Q.rear->next->next=p->next;
delete p;
}
if(Q.rear->next->next==Q.rear->next)
printf("0\n");
else printf("1\n");
}
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)==2&&(n||m))
{
Link Q;
Q.rear=new node;
Q.rear->next=Q.rear;
Push(Q,n);
Pop(Q,m);
}
return 0;
}