顺序栈:
#ifndef SeqStack_H
#define SeqSTACK_H
const int StackSize=10;
template<class DataType>
class SeqStack
{public:
SeqStack();
~SeqStack(){}
void Push(DataType x);
DataType Pop();
DataType GetTop();
int Empty();
private:
DataType data[StackSize];
int top;
};
#endif
#include"SeqStack.h"
template<class DataType>
SeqStack<DataType>::SeqStack()
{top=-1;
}
template<class DataType>
voidSeqStack<DataType>::Push(DataType x)
{if(top==StackSize-1)throw"上溢";
top++;
data[top]=x;
}
template<class DataType>
DataType SeqStack<DataType>::Pop()
{DataType x;
if(top=-1)throw"下溢";
x=data[top--];
return x;
}
template<class DataType>
DataType SeqStack<DataType>::GetTop()
{if(top!=-1;)
return data[top];
}
template<class DataType>
int SeqStack<DataType>::Empty()
{if(top==-1)return 1;
else return 0;
}
#include<iostream>
using namespace std;
#include"SeqStack.cpp"
void main()
{SeqStack<int>S;
if(S.Empty())
cout<<"栈为空"<<endl;
else
cout<<"栈非空"<<endl;
S.Push(15);
S.Push(10);
cout<<"栈顶元素为:"<<endl;
cout<<S.GetTop()<<endl;
cout<<"执行一次出栈操作"<<endl;
S.Pop();
cout<<"栈顶元素为:"<<endl;
cout<<S.GetTop()<<endl;
}
链栈:
#ifndef LinkStack_H
#define LinkStack_H
const int LinkStack=10;
template<class DataType>
class LinkStack
{public:
LinkStack(){top=NULL;}
~LinkStack(){};
void Push(DataType x);
DataType Pop();
DataType GetTop(){if(top!=NULL)returntop->data;}
int Empty(){top==NULL?return 1:return 0;}
private:
Node<DataType>*top;
};
#endif
#include"LinkStack.h"
template<class DataType>
voidLinkStack<DataType>::Push(DataType x)
{s=new Node;
s->data=x;
s->next=top;
top=s;
}
template<class DataType>
DataType LinkStack<DataType>::Pop()
{if(top==NULL)throw"下溢";
x=top->data;
p=top;
top=top->next;
delete p;
return x;
}
#include<iostream>
using namespace std;
#include"LinkStack.cpp"
void main()
{LinkStack<int>S;
if(S.Empty())
cout<<"栈为空"<<endl;
else
cout<<"栈非空"<<endl;
cout<<"对15和10 执行入栈操作"<<endl;
S.Push(15);
S.Push(10);
cout<<"栈顶元素为:"<<endl;
cout<<S.GetTop()endl;
cout<<"执行一次出栈操作"<<endl;
S.Pop();
cout<<"栈顶元素为:"<<endl;
cout<<S.GetTop()<<endl;
顺序队列:
#ifndef Cireue_H
#define Cireue_H
const int QueuSize=100;
template<class DataType>
class CirQueue
{public:
CirQueue(){front=rear=QueueSize-1;}
~CirQueue(){}
void EnQueue(DataType x);
DataType DeQueue();
DataType GetQueue();
int Empty(){front==rear?return 1:return 0;}
private:
DataTypedata[QueueSize];
intfront,rear;
};
#endif
template<class DataType>
voidCirQueue<DataType>::EnQueue(DatatType x)
{if((rear+1)%QueueSize==front)throw"上溢";
rear=(rear+1)%QueueSize;
data[rear]=x;
}
template<class DataType>
DataTypeCirQueue<DataType>::DeQueue()
{if(rear==front)throw"下溢";
front=(front+1)%QueueSize;
return data[front];
}
template<classs DataType>
DataTypeCirQueue<DataType>::GetQueue()
{if(rear==front) throw"下溢";
i=(front+1)%QueueSize;
return data[i];
}
#include<iostream>
using namespace std;
#include"CirQueue.cpp"
void main()
{CirQueue<int>.Q;
if(Q.Empty())
cout<<"队列为空"<<endl;
else
cout<<"元素10和15执行入队操作:"<<endl;
try
{Q.EnQueue(10);
Q.EnQueue(15);
}
catch(char *wrong)
{cout<<wrong<<endl;
}
cout<<"查看队头元素:"<<endl;
cout<<Q.GetQueue()<<endl;
cout<<"执行出队操作:"<<endl;
try
{D.DeQueue();
}
catch(char *wrong)
{cout<<wrong<<endl;
}
cout<<"查看队头元素:"<<endl;
cout<<Q.GetQueue()<<endl;
}
链队列:
#ifndef LinkQueue_H
#define LinkQueue_H
template<class DataType>
struct Node
{DataType data;
Node<DataType> *next;
};
template<class DataType>
class LinkQueue
{public:
LinkQueue();
~LinkQueue();
void EnQueue(DataType x);
DataType DeQueue();
DataType GetQueue();
int Empty();
private:
Node<DataType> *front,*rear;
};
#endif
#include"LinkQueue.h"
template<class DataType>
LinkQueue<DataType>::LinkQueue()
{Node<DataType> *s=NULL;
s=new Node<DataType>;
s->next=NULL;
front=rear=s;
}
template<class DataType>
LinkQueue<DataType>::~LinkQueue()
{Node<DataType> *p=NULL;
while(front!=NULL)
{p=front->next;
delete front;
front=p;
}
}
template<class DataType>
voidLinkQueue<DataType>::EnQueue(DataType x)
{Nide<DataType> *s=NULL;
s=new Node<DataType>;
s->data=x;
s->next=NULL;
rear->next=s;
rear=s;
}
template<class DataType>
DataTypeLinkQueue<DataType>::DeQueue()
{Node<DataType> *p=NULL;
int x;
if(rear==front)throw"下溢";
p=front->next;
x=p->data;
front->next=p->next;
if(p->next==NULL)rear=front;
delete p;
return x;
}
template<class DataType>
DataTypeLinkQueue<DataType>::GetQueue()
{if(front!rear)
return front->next->data;
}
template<class DataType>
int LinkQueue<DataType>::Empty()
{if(front==Rear)
return 1;
else
return 0;
}
#include<iostream>
using namespace std;
#include"LinkQueue.cpp"
void main()
{LinkQueue<int>.Q;
if(Q.Empty())
cout<<"队列为空"<<endl;
else
cout<<"元素10和15执行入队操作:"<<endl;
try
{Q.EnQueue(10);
Q.EnQueue(15);
}
catch(char *wrong)
{cout<<wrong<<endl;
}
cout<<"查看队头元素:"<<endl;
cout<<Q.GetQueue()<<endl;
cout<<"执行出队操作:"<<endl;
try
{D.DeQueue();
}
catch(char *wrong)
{cout<<wrong<<endl;
}
cout<<"查看队头元素:"<<endl;
cout<<Q.GetQueue()<<endl;
}