杨辉三角源代码

#include

#include

using namespace std;

enum error_code{underflow,success,overflow};

class queue{

public:

queue();

bool empty()const;

bool full()const;

error_code get_front(int & x)const;

error_code append(const int x);

error_code serve();

private:

int count;

int front,rear;

int data[50];

};

queue::queue(){count=0;front=rear=0;}

bool queue::empty()const{

if(count==0) return true;

return false;

}

bool queue::full()const{

if(count==49) return true;

return false;

}

error_code queue::get_front(int &x)const

{

if(empty())return underflow;

x=data[(front+1)%50];

return success;

}

error_code queue::append(const int x){

if(full())return overflow;

rear=(rear+1)%50;

data[rear]=x;

count++;

return success;

}

error_code queue::serve(){

if(empty()) return underflow;

front=(front+1)%50;

count--;

return success;

}

void out_number(int n)

{int s1,s2; queue Q;

cout<

Q.append(1);

for(int i=2;i<=n;i++){

s1=0;

cout<

for(int j=1;j<=i-1;j++)

{

Q.get_front( s2 );

Q.serve();

cout<

Q.append(s1+s2);

s1=s2;

}

cout<<1<

Q.append (1);

}

}

void main()

{ int n;

cout<<"请输入要显示杨辉三角的行数n=";

cin>>n;

out_number(n);

}