顺序栈
#include<iostream.h>
const int StackSize=10;
template<class DataType>
class SeqStack
{
public:
SeqStack();
~SeqStack(){}
voidPush(DataType x);
DataTypePop();
DataTypeGetTop();
intEmpty();
private:
DataTypedata[StackSize];
inttop;
};
template<class DataType>
SeqStack<DataType>::SeqStack()
{
top=-1;
}
template<class DataType>
voidSeqStack<DataType>::Push(DataType x)
{
if(top==StackSize-1)throw"上溢";
data[++top]=x;
}
template<class DataType>
DataType SeqStack<DataType>::Pop()
{
DataType x;
if(top==-1)throw"下溢";
x=data[top--];
returnx;
}
template<class DataType>
DataType SeqStack<DataType>::GetTop()
{
if(top!=-1)
returndata[top];
}
template<class DataType>
int SeqStack<DataType>::Empty()
{
if(top==-1)return 1;
else return 0;
}
void main()
{
SeqStack<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;
}
链栈
#include<iostream.h>
struct Node
{
int data;
Node *next;
};
class LinkStack
{
public:
LinkStack();
~LinkStack();
void Push(int x);
int Pop();
int GetTop();
int Empty();
private:
Node *top;
};
LinkStack::LinkStack()
{
top=NULL;
}
void LinkStack::Push(int x)
{
Node *s;
s=new Node;s->data=x;
s->next=top;top=s;
}
int LinkStack::Pop()
{
int x;
Node *p;
if(top==NULL)throw"下溢";
x=top->data;
p=top;
top=top->next;
delete p;
return x;
}
int LinkStack::GetTop()
{
return top->data;
}
int LinkStack::Empty()
{
if(top==NULL)
return 1;
else return 0;
}
LinkStack::~LinkStack()
{
Node *p=NULL;
while(top!=NULL)
{
Node *q;
q=top;
top=top->next;
delete q;
}
}
void main()
{
LinkStack L;
if(L.Empty())
cout<<"栈为空"<<endl;
else
cout<<"栈非空"<<endl;
cout<<"对15和10执行入栈操作"<<endl;
L.Push(15);
L.Push(10);
cout<<"栈顶元素为"<<endl;
cout<<L.GetTop()<<endl;
cout<<"执行一次出栈操作"<<endl;
L.Pop();
cout<<"栈顶元素为"<<endl;
cout<<L.GetTop()<<endl;
}
顺序队列
#include<iostream.h>const int QueueSize=100;
class CirQueue
{
public:
CirQueue();
~CirQueue(){};
void EnQueue(int x);
int DeQueue();
int GetQueue();
int Empty();
private:
int front,rear;
};
CirQueue::CirQueue()
{
rear=front=QueueSize-1;
}
void CirQueue::EnQueue(int x)
{
if((rear+1)%QueueSize==front)throw"上溢";
rear=(rear+1)%QueueSize;
rear=x;
}
int CirQueue::DeQueue()
{
if(rear==front)throw"下溢";
front=(front+1)%QueueSize;
return front;
}
int CirQueue::GetQueue()
{
int i;
if(rear==front)throw"下溢";
i=(front+1)%QueueSize;
return i;
}
int CirQueue::Empty()
{
if(front==rear)
return 1;
else return 0;
}
void main()
{
CirQueue Q;
if(Q.Empty())
cout<<"队列为空"<<endl;
else
cout<<"队列非空"<<endl;
cout<<"元素15和10执行入队操作"<<endl;
Q.EnQueue(10);
Q.EnQueue(15);
cout<<"队头元素为"<<endl;
cout<<Q.GetQueue()<<endl;
cout<<"执行出队操作"<<endl;
Q.DeQueue();
cout<<"队头元素为"<<endl;
cout<<Q.GetQueue()<<endl;
}
链队列
#include<iostream.h>
const int QueueSize=100;
struct Node
{
int data;
Node *next;
};
class LinkQueue
{
public:
LinkQueue();
~LinkQueue(){};
void EnQueue(int x);
int DeQueue();
int GetQueue();
int Empty();
private:
Node *front,*rear;
};
LinkQueue::LinkQueue()
{
Node *s;
s=new Node;s->next=NULL;
front=rear=s;
}
void LinkQueue::EnQueue(int x)
{
Node *s;
s=new Node;s->data=x;
s->next=NULL;
rear->next=s;
rear=s;
}
int LinkQueue::DeQueue()
{
Node *p;
int x;
if(rear==front)
cout<<"队列为空"<<endl;
p=front->next;x=p->data;
front->next=p->next;
if(p->next==NULL) rear=front;
delete p;
return x;
}
int LinkQueue::GetQueue()
{
return front->next->data;
}
int LinkQueue::Empty()
{
if(front==rear)
return 1;
else return 0;
}
void main()
{
LinkQueue Q;
if(Q.Empty())
cout<<"队列为空"<<endl;
else
cout<<"队列非空"<<endl;
cout<<"元素15和10执行入队操作"<<endl;
Q.EnQueue(10);
Q.EnQueue(15);
cout<<"队头元素为"<<endl;
cout<<Q.GetQueue()<<endl;
cout<<"执行出队操作"<<endl;
Q.DeQueue();
cout<<"队头元素为"<<endl;
cout<<Q.GetQueue()<<endl;
}