顺序栈实验:
头文件:
- #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>
- void SeqStack<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;
- cout<<"对8和4和7和3执行入栈操作"<<endl;
- S.Push(8);
- S.Push(4);
- S.Push(7);
- S.Push(3);
- cout<<"栈顶元素为:"<<endl;
- cout<<S.GetTop()<<endl;
- cout<<"执行一次出栈操作"<<endl;
- S.Pop();
- cout<<"栈顶元素为:"<<endl;
- cout<<S.GetTop()<<endl;
- cout<<"执行一次出栈操作"<<endl;
- S.Pop();
- cout<<"栈顶元素为:"<<endl;
- cout<<S.GetTop()<<endl;
- cout<<"执行一次出栈操作"<<endl;
- S.Pop();
- cout<<"栈顶元素为:"<<endl;
- cout<<S.GetTop()<<endl;
- cout<<"执行一次出栈操作"<<endl;
- S.Pop();
- }
链队列:
头文件:
- #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>
- void LinkQueue<DataType>::EnQueue(DataType x)
- {
- Node<DataType> *s=NULL;
- s=new Node<DataType>;
- s->data=x;
- s->next=NULL;
- rear->next=s;rear=s;
- }
- template<class DataType>
- DataType LinkQueue<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>
- DataType LinkQueue<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<<"队列非空"<<endl;
- cout<<"元素10和15和20和25执行入队操作"<<endl;
- try
- {
- Q.EnQueue(10);
- Q.EnQueue(15);
- Q.EnQueue(20);
- Q.EnQueue(25);
- }
- catch(char* wrong)
- {
- cout<<wrong<<endl;
- }
- cout<<"查看队头元素:"<<endl;
- cout<<Q.GetQueue()<<endl;
- cout<<"执行出队操作:"<<endl;
- try
- {
- Q.DeQueue ();
- }
- catch (char* wrong)
- {
- cout<<wrong<<endl;
- }
- cout<<"查看队头元素:"<<endl;
- cout<<Q.GetQueue()<<endl;
- cout<<"执行出队操作:"<<endl;
- try
- {
- Q.DeQueue ();
- }
- catch (char* wrong)
- {
- cout<<wrong<<endl;
- }
- cout<<"查看队头元素:"<<endl;
- cout<<Q.GetQueue()<<endl;
- }