//链接队列
struct node
{
int data;
node* next;
};
void enq(node* &f,node* &r,int x)
{
node* pNewNode = new node();
pNewNode->data = x;
pNewNode->next = NULL;
if(f == NULL)
{
f = pNewNode;
}
else
{
r->next = pNewNode;
}
r = pNewNode;
}
//删除链接队列
int deq(node *&f,node *&f)
{
if(f == NULL)
{//如果链接队列为空
return -1;
}
else
{
int iReturn = f->data;
node* p = f;
f = f->next;
free(p);
return iReturn;
}
}