顺序栈—类的构建||双栈共享栈空间

最新推荐文章于 2025-10-13 09:52:36 发布

原创最新推荐文章于 2025-10-13 09:52:36 发布 · 276 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#栈

栈专栏收录该内容

2 篇文章

订阅专栏

这篇博客介绍了如何使用C++构建顺序栈，并实现动态扩容功能。同时，展示了如何设计一个双栈共享栈空间的类，允许两个栈共用同一内存空间，有效地提高了空间利用率。在操作过程中，注意了栈的判空和元素的添加与移除。

顺序栈类的构建

template <class T>
class Stack {
public:
	Stack(int size) {
		elements = new T[size];
		MaxSize = size;
		topp =0;//是最接近栈顶的一个空位置
	}
	~Stack()
	{
		delete []elements;
	}
	void OverStack() {//向顺序表一样，以指数的形式拓展
		T* NewArray=NULL;
		int size = MaxSize;
		if (topp >= 0.5 * size) {
			NewArray = new T[2 * size], MaxSize *= 2;
			for (int i = 0; i < topp; ++i)
				NewArray[i] = elements[i];//简单的copy
			delete[]elements;
			elements = NewArray;
		}
	}
	bool IsFull() {
		if (topp == MaxSize + 1)
			return 1;
		return 0;
	}
	bool IsEmpty() {
		if (topp == 0)
			return 1;
		return 0;
	}
	int size() {
		return topp;
	}
	void pop() {
		if(!IsEmpty())
			--topp;
	}
	void push(T a) {
		OverStack();//扩大栈空间
		++topp;
		elements[topp - 1] = a;
	}
	T top() {
		if(!IsEmpty())
			return elements[topp - 1];
	}
	void clear() {
		topp = 0;
	}

	

private:
	T* elements;
	int topp;
	int MaxSize;
};

双栈共享栈空间

//必要的操作如pop，top记得判空！！
template <class T>
class Stack {
public:
	Stack(int size) {
		elements = new T[size];
		MaxSize = size;
		topp0 = -1;//0号栈顶
		topp1 = MaxSize;//1号栈顶
	}
	~Stack()
	{
		delete[]elements;
	}

	bool IsFull() {
		if (topp0+1 == topp1)//0号栈顶+1==1号栈顶
			return 1;
		return 0;
	}
	bool IsEmpty0() {
		if (topp0 == -1)
			return 1;
		return 0;
	}
	bool IsEmpty1() {
		if (topp1 == MaxSize)
			return 1;
		return 0;
	}
	int size() {
		return MaxSize;
	}
	void pop(int choice) {//0号栈和1号栈
		if (choice != 1 && choice != 0)
			return;
		if (choice == 0 && !IsEmpty0()) {
			--topp0; return;
		}
		if (choice == 1 && !IsEmpty1()) {
			++topp1; return;
		}
		cout << "栈为空！" << endl;
		return;
	}
	void push(T a, int choice) {
		if ((choice != 1 && choice != 0) || topp0+1 == topp1)
			return;
		if (choice == 0) {
			++topp0;//从左往右
			elements[topp0] = a;
		}
		else {
			--topp1;//从右往左
			elements[topp1] = a;
		}
	}
	T top(int choice) {
		if (choice != 1 && choice != 0) {
			cout << "输入的栈序号错误！" << endl;
			return -1;
		}
		if (choice == 0&& !IsEmpty0()) {
			return elements[topp0];
		}
		if(choice == 1 && !IsEmpty1()) {
			return elements[topp1] ;
		}
		cout << "栈为空！" << endl;
		return -1;
	}
	void clear() {
		topp0 = -1;
		topp1 = MaxSize;//恢复到原来的样子
	}



private:
	T* elements;
	int topp0,topp1;
	int MaxSize;
};