數(shù)據(jù)結(jié)構(gòu)對(duì)元素類型為整型的順序存儲(chǔ)的線性表進(jìn)行插入、刪除和查找操作

1、數(shù)據(jù)結(jié)構(gòu)對(duì)元素類型為整型的順序存儲(chǔ)的線性表進(jìn)行插入、刪除和查找操作#include<iostream>using namespace std;const int stackIncreament=20;class SeqStackprivate:int *elements;int top;int maxSize;void overflowProcess();/ 棧的溢出處理 public:SeqStack(int sz=50); SeqStack()deleteelements; void Push(const int& x); bool Pop(int& x); b

2、ool getTop(int& x);bool IsEmpty()const return (top=1)?true:false;bool IsFull()const return (top=maxSize-1)?true:false; int getSize()constreturn top+1; void MakeEmpty()top=-1;friend ostream& operator<<(ostream& os,SeqStack& s) os<<"top="<<s.top<<endl;

3、for(int i=0;i<=s.top;i+)os<<i<<":"<<s.elementsi<<endl;return os;SeqStack:SeqStack(int sz):top(-1),maxSize(sz) elements=new intmaxSize;void SeqStack:overflowProcess()/ 私有函數(shù) : 擴(kuò)充棧的存儲(chǔ)空間int *newArray=new intmaxSize+stackIncreament;for(int i=0;i<=top;i+)newArrayi=e

4、lementsi;maxSize=maxSize+stackIncreament;deleteelements;elements=newArray;void SeqStack:Push(const int& x) if(IsFull()=true)overflowProcess();/ 棧滿則溢出處理 elements+top=x;/ 棧頂指針先加 , ，再進(jìn)棧 bool SeqStack:Pop(int& x)if(IsEmpty()=true)return false;x=elementstop-;return true;bool SeqStack:getTop(int&a

5、mp; x) if(IsEmpty()=true)return false; x=elementstop;return true;void main()SeqStack s;int n=20;for(int i=1;i<=n;i+)/ 推進(jìn) 20 個(gè)數(shù)據(jù)s.Push(i);cout<<s;cout<<endl<<" 退棧前元素個(gè)數(shù) :"<<s.getSize()<<endl; int x;if(s.Pop(x); / 棧頂元素退棧 cout<<" 退棧元素是 :"<<x<<endl;