数据结构用循环队列写杨辉三角

杨辉三角问题

#define MAXSIZE 100
#define OK 1
#define ERROR 0
#define OVERFLOW 1
#include <stdlib.h>
#include <stdio.h>
typedef struct {
	int* base;
	int front;
	int rear;
}SqQueue;
int InitQueue(SqQueue& Q) {
	Q.base = new int[MAXSIZE];
	if (!Q.base) exit(OVERFLOW);
	Q.front = Q.rear = 0;
	return OK;
}
int EnQueue(SqQueue& Q, int e) {
	if ((Q.rear + 1) % MAXSIZE == Q.front)	return ERROR;
	Q.base[Q.rear] = e;
	Q.rear = (Q.rear + 1) % MAXSIZE;
	return OK;
}
int DeQueue(SqQueue& Q, int& e) {
	if (Q.front == Q.rear) return ERROR;
	e = Q.base[Q.front];
	Q.front = (Q.front + 1) % MAXSIZE;
	return OK;
}
int YHSJ(int n) {
	int i, j, s = 0, t = 0;
	SqQueue Q;
	InitQueue(Q);
	EnQueue(Q, 1);
	EnQueue(Q, 1);
	for (i = 1; i <= n; i++) {
		EnQueue(Q, 0);
		for (j = 1; j <= i + 2; j++) {
			DeQueue(Q, t);
			EnQueue(Q, s + t);
			s = t;
			if (j != i + 2) { printf("%d", s); }
			printf(" ");
		}
		printf("\n");
	}
	return 0;
}
int main() {
	int num;
	printf("请输入你想打印的杨辉三角的行数：");
	scanf_s("%d", &num);
	printf("%d行的杨辉三角如下：\n",num);
	YHSJ(num);
	return 0;
}