顺序栈

最新推荐文章于 2023-10-20 21:42:37 发布

terry_v

最新推荐文章于 2023-10-20 21:42:37 发布

阅读量225

点赞数

本文链接：https://blog.csdn.net/terry_v/article/details/6782968

版权

#include <assert.h>
#define NULL 0
#define defaultSize 50
#define stackIncreament 20

class SeqStack                                                                         //顺序栈的类定义；
{
public:
	SeqStack(int sz=defaultSize)
	{
		maxSize=sz; top=-1;
		elements=new int[maxSize]; assert(elements!=NULL);
	}
	~SeqStack() {delete [] elements;}
	void Push(const int& x)
	{
		if(IsFull()==true) overflowProcess();
		elements[++top]=x;
	}
	bool Pop(int& x)
	{
		if(IsEmpty()==true) return false;
		x=elements[top--];
		return true;
	}
	bool getTop(int& x)
	{
		if(IsEmpty()==true) return false;
		x=elements[top];
		return true;
	}
	bool IsEmpty() const {return top==-1;}
	bool IsFull() const {return top==maxSize-1;}
	int getSize() const {return top+1;}
	void MakeEmpty() {top=-1;}
private:
	void overflowProcess()                                                      //扩充栈的存储空间；
	{
		int *newArray=new int[maxSize+stackIncreament]; assert(newArray!=NULL);
		for(int i=0; i<=top; i++) newArray[i]=elements[i];
		maxSize+=stackIncreament;
		delete [] elements;
		elements=newArray;
	}
private:
	int *elements;
	int top;
	int maxSize;
};

#endif