共享栈（双栈）

共享栈（双栈）

#include <stdio.h>
using namespace std;

typedef int ElemType;
#define maxSize 100

typedef struct{
	ElemType data[maxSize];   //shared stack(left stack + right stack)
	int leftTop;    //left top point
	int rightTop;   //right top point
}SharedStack;


// left start with -1    right start with maxSize 
void initSharedStack(SharedStack &S){
	S.leftTop = -1;
	S.rightTop = maxSize;
}


//left stack push elem
bool pushLeft(SharedStack &S, ElemType e){
	if(S.rightTop - S.leftTop == 1){
		return false;
	}
	S.data[++S.leftTop] = e;
	return true;
}

//right stack push elem
bool pushRight(SharedStack &S, ElemType e){
	if(S.rightTop - S.leftTop == 1){
		return false;
	}
	S.data[--S.rightTop] = e;
	return true;
}

//left stack pop elem
bool popLeft(SharedStack &S, ElemType &e){
	if(S.leftTop == -1){
		return false;
	}
	e = S.data[S.leftTop--];
	return true;
}

//right stack pop elem
bool popRight(SharedStack &S, ElemType &e){
	if(S.rightTop == maxSize){
		return false;
	}
	e = S.data[S.rightTop++];
	return true;
}


//judge left stack empty or not
bool emptyLeftStack(SharedStack S){
	if(S.leftTop == -1){
		return true;
	}
	return false;
}


//judge right stack empty or not
bool emptyRightStack(SharedStack S){
	if(S.rightTop == maxSize){
		return true;
	}
	return false;
}

bool GetLeftElem(SharedStack S, ElemType &e){
	if(S.leftTop == -1){
		return false;
	}
	e = S.data[S.leftTop];
	return true;
}

bool GetRightElem(SharedStack S, ElemType &e){
	if(S.rightTop == maxSize){
		return false;
	}
	e = S.data[S.rightTop];
	return true;
}

void destoryLeftSharedStack(SharedStack &S){
	S.leftTop = -1;
}

void destoryRightSharedStack(SharedStack &S){
	S.rightTop = maxSize;
}



int main(){
	return 0;
}