typedef struct node{
?char data;
?node *next;
} NODE;
NODE *front=NULL, *rear=NULL;
void intoQueue(char x)//入隊(duì)
{
?
?NODE *p=(NODE *)malloc(sizeof(NODE));//分配空間和賦值
?p->data=x;
?p->next=NULL;
?
?if(front==NULL)//空隊(duì)列
?{
??front=p;
?}
?else
?{
??rear->next=p;
?}
?rear=p;
}
int outQueue(char *p_y)//出隊(duì)
{
?NODE *p=(NODE *)malloc(sizeof(NODE));
?if(front==NULL) return -1;
?p=front;
?front=front->next;
?*p_y=p->data;
?free(p);
?return 0;
}
int isEmpty()
{
?if(*front==NULL) return 0;
?else return-1;
}
posted on 2006-09-24 19:45
創(chuàng)建更好的解決方案 閱讀(567)
評論(0) 編輯 收藏 引用