Queue类的实现与Stack的实现.doc

/包括queue类的实现及杨辉三角的输出#include#include#includeusing namespace std;template class queueprotected: struct nodeT data;node *next;public:node(T value,node* link)data=value;this-next=link-next;link-next=this;node(T value) data=value;private: node *last;public:queue(T value) last=new node(value); last-next=last;queue()while(last!=last-next) pop();free(last);queue(queue &ori) node *p1=new node(1),*p2=ori.last; p1-data=p2-data; last=p1; while(p2-next!=ori.last) p2=p2-next;p1=new node(p2-data,p1); p1-next=last; p1=last;void push(T value)last=new node(value,last); void pop()if(last=NULL) coutQueue is empty !next;if(last-next=last) last=NULL;else last-next=last-next-next;free(p);T front()return last-next-data;bool empty()if(last=NULL) return true;return false;void yhui(int n) queueque(1); que.push(1); coutC0: 1endl; for(int i=2;i=n+1;i+) int ans=0; que.push(0); coutCi-1: ; for(int j=0;ji+1;j+) que.push(ans+que.front(); ans=que.front(); que.pop(); if(j!=i) printf(%-4d ,ans); coutendl; int main()int n;coutn) yhui(n);return 0;/以下是Stack的实现代码#ifndef STACK_H#define STACK_H#include /精简版#include#include #includeusing namespace std;template class Stackprotected:struct nodeT data;node *next,*last;node(T item,node*ptr)data=item;ptr-next=this;this-last=ptr;node(T item) data=item;private: node *head;int size;public:Stack()head=NULL;size=0; Stack()while(size-)node *del=head;head=head-last;free(del);bool empty() return size=0?true:false;void push(T value) head=(+size)=1?new node(value):new node(value,head);void pop(