Queue类的实现与Stack的实现

《Queue类的实现与Stack的实现》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、//包括queue类的实现及杨辉三角的输出#include#include#includeusingnamespacestd;templateclassqueue{protected:structnode{Tdata;node*next;public:node(Tvalue,node*link){data=value;this->next=link->next;link->next=this;}node(Tvalue){data=value;

2、}};private:node*last;public:queue(Tvalue){last=newnode(value);last->next=last;}~queue(){while(last!=last->next)pop();free(last);}queue(queue&ori){node*p1=newnode(1),*p2=ori.last;p1->data=p2->data;last=p1;while(p2->next!=ori.last){p2=p2->next;p1=newnode(p2->da

3、ta,p1);}p1->next=last;p1=last;}voidpush(Tvalue){last=newnode(value,last);}voidpop(){if(last==NULL){cout<<"Queueisempty!!"<next;if(last->next==last)last=NULL;elselast->next=last->next->next;free(p);}Tfront(){returnlast->next->data;}

4、boolempty(){if(last==NULL)returntrue;returnfalse;}};voidyhui(intn){queueque(1);que.push(1);cout<<"C0:"<<1<

5、!=i)printf("%-4d",ans);}cout<>n)yhui(n);return0;}//以下是Stack的实现代码#ifndefSTACK_H#defineSTACK_H#include//精简版#include#include#includeusingnamespacestd;templateclassStack{

6、protected:structnode{Tdata;node*next,*last;node(Titem,node*ptr){data=item;ptr->next=this;this->last=ptr;}node(Titem){data=item;}};private:node*head;intsize;public:Stack(){head=NULL;size=0;}~Stack(){while(size--){node*del=head;head=head->last;free(del);}}boole

7、mpty(){returnsize==0?true:false;}voidpush(Tvalue){head=(++size)==1?newnode(value):newnode(value,head);}voidpop(){if(size==0){cout<<"Stackempty!!"<last;free(del);size--;}T&top(){returnhead->data;}};#endif