#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define max_size 6
typedef int ElemType;
typedef struct SqQueue {
ElemType data[max_size];
int front, rear;
}SqQueue;
void initial(SqQueue& Q) {
Q.front = Q.rear = 0;
}
bool isEmpty(SqQueue Q) {
if (Q.front == Q.rear) {
return true;
}
else {
return false;
}
}
//队尾入队列
bool EnQueue(SqQueue& Q, ElemType e) {
if ((Q.rear + 1) % max_size == Q.front) {
return false;
}
Q.data[Q.rear] = e;
Q.rear = (Q.rear + 1) % max_size;
return true;
}
//对头元素出队
bool DeQueue(SqQueue& Q, ElemType& e) {
if (Q.front == Q.rear) {
return false;
}
e = Q.data[Q.front];
Q.front = (Q.front + 1) % max_size;
return true;
}
int main() {
SqQueue Q;
initial(Q);
int arr[max_size] = { 0 };
int len = 0;
int num;
while (scanf("%d", &arr[len])&&arr[len]!=-2) {
if (arr[len] != -1) {
EnQueue(Q, arr[len]);
len++;
}
else {
if (isEmpty(Q)) {
printf("NULL");
}
else {
DeQueue(Q, num);
}
}
}
if (isEmpty(Q)) {
printf("NULL");
}
else {
while (!isEmpty(Q)) {
DeQueue(Q, num);
printf("%d ", num);
}
}
return 0;
}
队列的操作
最新推荐文章于 2024-07-22 19:36:52 发布