循环队列实现杨辉三角

经过前面的介绍，如果自己动手写过代码，会发现下面的代码是比较容易实现的，这里我就不做解释，把精力留到后面二叉树、图的实现再细谈

#include <iostream>

using namespace std;
#define MAXQSIZE 100
typedef int QElemType;
typedef struct
{
QElemType *base;
int front;
int rear;
}SqQueue;
bool InitQueue(SqQueue &Q)
{
Q.base=(QElemType *)malloc(MAXQSIZE*sizeof(QElemType));
if(!Q.base) return 0;
Q.front=Q.rear=0;
return 1;
}
int QueueLength(SqQueue &Q)
{
return (Q.rear-Q.front+MAXQSIZE)%MAXQSIZE;
}
bool EnQueue(SqQueue &Q,QElemType e)
{
if((Q.rear+1)%MAXQSIZE==Q.front) return 0;
Q.base[Q.rear]=e;
Q.rear=(Q.rear+1)%MAXQSIZE;
return 1;
}
bool DeQueue(SqQueue &Q,QElemType &e)
{
if(Q.front==Q.rear) return 0;
e=Q.base[Q.front];
Q.front=(Q.front+1)%MAXQSIZE;
return 1;
}
int main()
{
int num,i,j,k;
QElemType elem;
QElemType *p;
SqQueue queue;
InitQueue(queue);
EnQueue(queue,1);
cout<<"Please input the mount you want to output:"<<endl;
cin>>num;
for(i=0;i<num;i++)
{
EnQueue(queue,1);
p=queue.base;
k=queue.front;
for(j=0;j<i;j++)
{
elem=p[k]+p[k+1];
EnQueue(queue,elem);
k++;
}
EnQueue(queue,1);
for(j=0;j<=i;j++)
{
DeQueue(queue,elem);
cout<<elem<<"  ";
}
cout<<endl;
}
return 0;
}