C++：杨辉三角的队列实现

#include <bits/stdc++.h>
const int MAXSIZE = 10;
const int LINE = MAXSIZE -4;

using namespace std;

typedef struct{
    int data[MAXSIZE];
    int front;
    int rear;
}SeqQueue;

SeqQueue *IniQueue()
{
    SeqQueue *q;
    q = (SeqQueue *)malloc(sizeof(SeqQueue));
    q -> front = q -> rear = 0;
    return q;
}

void EnQueue(SeqQueue *q, int x)
{
    if((q -> rear + 1) % MAXSIZE == q -> front) exit(1);
    q -> data[q -> rear] = x;
    q -> rear = (q -> rear + 1) % MAXSIZE;
}

int DeQueue(SeqQueue *q)
{
    int x;
    if(q -> front == q -> rear) exit(1);
    x = q -> data[q -> front];
    q -> front = (q -> front + 1) % MAXSIZE;
    return x;
}

int QueueEmpty(SeqQueue *q)
{
    return (q -> front == q -> rear);
}

int GetHead(SeqQueue *q)
{
    int x;
    if(q -> front == q ->rear) return 0;
    else x = q -> data[q -> front];
    return x;
}

void TranversalSq(SeqQueue q)
{
    do
    {
        cout<<DeQueue(&q)<<"\t";
    }while(!QueueEmpty(&q));
}

void YangHui(int n)
{
    SeqQueue *q;
    int s,t;
    cout<<"1"<<endl;
    q = IniQueue();
    EnQueue(q, 0);
    EnQueue(q, 1);
    EnQueue(q, 1);
    for(int j = 1; j <= n; j++)
    {
        EnQueue(q, 0);
        do
        {
            s = DeQueue(q);
            t = GetHead(q);
            if(t)
                cout<<t<<"\t";
            else cout<<endl;
            EnQueue(q, s + t);
        }while(t != 0);
    }

    DeQueue(q);
    TranversalSq(*q);
}

int main()
{
    YangHui(LINE);
    return 0;
}