#include<stdio.h>
#define MaxSize 20
typedef int ElemType;
typedef struct{
ElemType data[MaxSize];
int front, rear,size;
}SqQueue;
bool InitQueue(SqQueue &S) {
S.size = 0;
S.front = 0;
S.rear = 0;
return true;
}
bool EnQueue(SqQueue &S, ElemType e) {
if (S.size == MaxSize) return false;
S.data[S.rear] = e;
S.rear = (S.rear + 1) % MaxSize;
S.size++;
return true;
}
bool DeQueue(SqQueue& S,ElemType &e) {
if (S.size == 0) return false;
e = S.data[S.front];
S.front = (S.front + 1) % MaxSize;
S.size--;
return true;
}
int main() {
SqQueue S;
InitQueue(S);
EnQueue(S, 1);
EnQueue(S, 2);
EnQueue(S, 3);
ElemType e;
DeQueue(S, e);
printf("%d",e);
DeQueue(S, e);
printf("%d",e);
DeQueue(S, e);
printf("%d",e);
return 1;
}
数据结构(C/C++)——顺序循环队列
最新推荐文章于 2024-05-03 13:48:12 发布