#include<stdio.h>
#define maxsize 100
typedef struct node{
 char data[maxsize];
 int front,rear;
 }seqqueue;        
/*建立循環(huán)鏈表*/
initqueue(seqqueue *q)       /*隊(duì)列初始化*/
{
 q->front=-1;
 q->rear=-1;
}

enqueue(seqqueue *q,char *s) /*數(shù)據(jù)元素進(jìn)隊(duì)*/

{
 int i=0;
 while(s[i]!='\0')
 {
 if((q->rear+1)%maxsize==q->front){
  printf("隊(duì)列已經(jīng)滿.\n");
  return 0;}
 q->rear=(q->rear+1)%maxsize;
 q->data[q->rear]=s[i];
 i++;
 }
}
delqueue(seqqueue *q,char *e)
{
 if(q->rear==q->front){
 printf("隊(duì)列為空.\n");
 return 0;
 }
q->front=(q->front+1)%maxsize;
*e=q->data[q->front];
return 1;
}
main()
{
 seqqueue q;char *s,e;
 initqueue(&q);
 printf("請(qǐng)輸入進(jìn)隊(duì)的字符串.\n");
 gets(s);
 enqueue(&q,s);
 while(q.front!=q.rear){
  delqueue(&q,&e);
  printf("%c",e);
 }
}