#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<time.h>
#define TURE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define MAXSIZE 100
typedef int Status;
typedef struct{
int stuNo;
char name[10];
}Student;
typedef struct{
Student* base;
int front;
int rear;
}SqQueue;
Status InitQueue(SqQueue &Q){
Q.base = (Student*)malloc(MAXSIZE*sizeof(Student));
if(!Q.base) return OVERFLOW;
Q.front = Q.rear =0;
return OK;
}
int QueueLength(SqQueue Q){
return (Q.rear-Q.front+MAXSIZE)%MAXSIZE;
}
Status EnQueue(SqQueue &Q,Student s){
if((Q.rear+1)%MAXSIZE==Q.front) return ERROR;
Q.base[Q.rear]=s;
Q.rear =(Q.rear+1)%MAXSIZE;
return OK;
}
Status DeQueue(SqQueue &Q,Student &s){
if(Q.rear==Q.front) return ERROR;
s = Q.base[Q.front];
Q.front = (Q.front+1)%MAXSIZE;
return OK;
}
Status EmptyQueue(SqQueue Q){
if(Q.front==Q.rear) return TURE;
else return FALSE;
}
void travelQueue(SqQueue Q){
int p;
printf("队列中元素为:\n");
for(p=Q.front;(p+1)%MAXSIZE!=Q.rear;p=(p+1)%MAXSIZE){
printf("%d %s\n",Q.base[p].stuNo,Q.base[p].name);
}
printf("%d %s\n",Q.base[p].stuNo,Q.base[p].name);
printf("\n");
}
int main(){
SqQueue q;
InitQueue(q);
Student s;
strcpy(s.name,"");
srand(time(0));
for(int i=0;i<5;i++){
s.stuNo=rand()%100+1;
strcat(s.name,"a");
EnQueue(q,s);
}
travelQueue(q);
printf("出队:\n");
DeQueue(q,s);
travelQueue(q);
printf("入队:\n");
s.stuNo=rand()%100+1;
strcat(s.name,"a");
EnQueue(q,s);
travelQueue(q);
return 0;
}