C++实现的杨辉三角,使用循环队列实现,默认单个数字宽度是4。
//yang hui Triangle
#include "iostream"
#include "stdlib.h"
#define maxsize 100
typedef int datatype;
using namespace std;
//data structure of seqqueue
typedef struct
{
datatype data[maxsize];
int front,rear;
}seqQueue,*pseqQueue;
//initcialize
pseqQueue init_SeqQueue(){
pseqQueue q;
q=(pseqQueue)malloc(sizeof(seqQueue));
if(q){
q->front=0;
q->rear=0;
}
return q;
}
//is seq empty
int is_SeqQueue_Empty(pseqQueue q){
if (q&&q->front==q->rear)
return 1;
return 0;
}
int is_SeqQueue_Full(pseqQueue q){
if((q->rear+1)%maxsize==q->front)
return 1;
return 0;
}
//in seq
int in_SeqQueue(pseqQueue q,datatype d){
if (is_SeqQueue_Full(q))
{
cout<<"seqqueue is is full."<<endl;
return -1;
}else{
q->rear=(q->rear+1)%maxsize;
q->data[q->rear]=d;
retu