王道数据结构代码题（C语言） 队列部分

1.

#include <stdio.h>
#include <stdlib.h>
#define TYPE int 
struct Squeue {
	TYPE *arr;
	int front, rear;
	int tag;
};

//创建队列
Squeue *create(int n) {
	Squeue *sq = (Squeue *)malloc(sizeof(Squeue));
	sq->arr = (TYPE *)malloc(sizeof(TYPE)*n);//数组大小
	sq->front = 0;
	sq->rear = 0;
	sq->tag = 0;
	return sq;
}
//判断队满
bool isFull(Squeue *sq, int maxSize) {
	return (sq->rear == sq->front) && (sq->tag == 1);
}
//判断队空
bool isEmpty(Squeue *sq) {
	return (sq->front == sq->rear) && sq->tag==0;
}
//判断队列中元素个数
int count(Squeue *sq, int maxSize) {
	return (sq->rear - sq->front + maxSize) % maxSize;
}
//入队
bool enQueue(Squeue *sq, int data, int maxSize) {
	if (isFull(sq, maxSize)) return false;
	sq->arr[sq->rear] = data;
	sq->rear = (sq->rear + 1) % maxSize;
	sq->tag = 1;
	return true;
}
//出队
bool deQueue(Squeue *sq, int &data, int maxSize) {
	if (isEmpty(sq)) return false;
	data = sq->arr[sq->front];
	sq->front = (sq->front + 1) % maxSize;
	sq->tag = 0;
	return true;
}

2.

#include <stdio.h>
#include <stdlib.h>



struct Stack{
	NODETYPE* arr;	//内存首地址
	int  len;	//栈的容量
	int top; 	//栈的下标
};

struct Squeue {
	NODETYPE* arr;
	int front, rear;
};
int main() {
	struct Squeue *sq;
	struct Stack *s;
	int n,data;
	Squeue *createQueue(int );
	bool enQueue(Squeue *,int,int);
	bool deQueue(Squeue *,int *,int);
	void printQ(Squeue *, int );
	Stack *createStack(int );
	bool push(Stack *,int );
	bool pop(Stack *);
	int top(Stack *);

	printf("请输入队列及栈大小:");
	scanf("%d",&n);
	sq = createQueue(n+1);//因为是循环队列，需要留一个空间作为满空判定
	s = createStack(n);
	for (int i = 0; i < n;i++) {
		printf("请输入第%d个入队元素：",i+1);
		scanf("%d",&data);
		enQueue(sq,data, n + 1);//入队
	}
	printf("原队列中元素为：");
	printQ(sq,n+1);
	printf("\n");
	for (int i = 0; i < n;i++) {
		deQueue(sq,&data, n + 1);//出队
		push(s,data);//入栈
	}
	for (int i = 0; i < n; i++) {
		data = top(s);
		pop(s);//出栈
		enQueue(sq,data, n + 1);//入队
	}
	printf("逆转后队列中元素为：");
	printQ(sq, n + 1);


}