共享栈 （数据结构）

两个栈共享空间

	利用一个数组来存储两个栈;让一个栈底为数组的首端;一个栈底为数组的末端.每个栈都向数组中间延伸,以此来充分利用数组的空间。
	只适用于两个相同的数据类型

#include<iostream>
using namespace std;
#define maxsize 10

template<class T>
class sqdoublestack {
public:
	sqdoublestack();
	~sqdoublestack();
	
	void push(int stacknumberi, T x);	//入栈：stacknumber 选择在哪个栈顶插入
							
	T pop(int stacknumber, T &e);	  //出栈：stacknumber 选择在哪个栈顶弹出

	bool isempty(int stacknumber);		//判空	

	bool ispull();						//判满

	void travelstack(int stacknumber);	//遍历输出

	void clear(int stacknumber);		//清空
private:
	T  data[maxsize];
	int top1;	//栈1的栈顶位置
	int top2;	//栈2的栈顶位置
};

//初始化
template<class T>
sqdoublestack<T>::sqdoublestack()
{
	//data = new T[maxsize];
	this->top1 = -1;
	this->top2 = maxsize;
}
//析构释放
template<class T>
sqdoublestack<T>::~sqdoublestack()
{
	
}

//判空
template<class T>
bool sqdoublestack<T>::isempty(int stacknumber)
{
	if (stacknumber == 1)
	{
		if (this->top1 == -1) {
			cout << "栈1为空！";
			return 1;
		}
		else
			return 0;
	}
	if (stacknumber == 2)
	{

		if (this->top2 == maxsize) {
			cout << "栈2为空！";
			return 1;
		}
		else
			return 0;
	}
}
//判满
template<class T>
bool sqdoublestack<T>::ispull()
{
	return this->top1 + 1 == this->top2;
}

//入栈
template<class T>
void sqdoublestack<T>::push(int stacknumber, T x)          //入栈
{
	if (!this->ispull())	//栈未满，ispull()=0;
	{
		if (stacknumber == 1) data[++top1] = x;
		if (stacknumber == 2) data[--top2] = x;
	}
}
//出栈
template<class T>
T sqdoublestack<T>::pop(int stacknumber, T &e)
{
	
	
	if (stacknumber == 1)//栈1  出栈
	{
		if (this->isempty(1))		//栈1空不能出栈
			return 0;
		e = this->data[this->top1--];
	}
	else if (stacknumber == 2)		//栈2  出栈
	{
		if (this->isempty(2))		//栈2空不能出栈
			return 0;
		e = this->data[this->top2++];	
	}
	return e;
}

//遍历输出
template<class T>
void sqdoublestack<T>::travelstack(int stacknumber)
{
	int p = this->top1;
	int q = this->top2;
	if (stacknumber == 1) {
		while (p != -1)
			cout << this->data[p--] << " ";
		cout << endl;
	}
	if (stacknumber == 2) {
		while (q != maxsize)
			cout << this->data[q++] << " ";
		cout << endl;
	}
}
//清空
template<class T>
void sqdoublestack<T>::clear(int stacknumber)
{
	if (stacknumber == 1)
		this->top1 = -1;
	
	if (stacknumber == 2)
		this->top2 = maxsize;
}
int main()
{
	sqdoublestack <int> s;
	int e;
	for (int i = 0; i <10; i++)
	{
		s.push(2, i);
	}
	cout << s.isempty(2) << endl;//判空
	cout << s.ispull() << endl;//判满
	
	cout << s.pop(2, e) << endl;//出栈
	cout << s.pop(2, e) << endl;
	//s.clear(2);
	s.travelstack(2);
	system("pause");
	return 0;
}