#?include?“stdio.h“
#?include?“ctype.h“
#?include?“string.h“
#?include?“stdlib.h“
#?include??“math.h“
#?define?MAXSIZE?100
typedef?char?elemtype;
typedef?struct{???????????????????????????????????
	/*定義棧結(jié)構(gòu)*/
??elemtype?data[MAXSIZE];??????????????????????????
??/*定義棧的大小*/
??int?top;?????????????????????????????????????????
??/*定義棧的指針*/
}sqstack;

void?init_sqsqstack（sqstack*S）{??????????????????????
	/*初始化棧*/
??S->top?=?-1;?????????????????????????????????????????
??/*棧底定義為-1，用來(lái)判斷是否為空*/
}

int?empty_sqstack（sqstack*S）{?????????????????????????
	/*判斷棧是否為空*/
??if?（S->top==-1）??????????????????????????????????????
	??/*棧指針值為-1，則棧是為空并返回?1*/
	??return?1;
??else
	??return?0;??????????????????????????????????????????
??/*棧指針值不為-1，則棧不為空，此時(shí)返回?0*/
}

void?push_sqstack（sqstack*Selemtype?x）{??????????????
	/*入棧，當(dāng)棧滿時(shí)提示*/
??if?（S->top==MAXSIZE-1）????????????????????????????????
	??/*棧指針值為最大值（MAXSIZE）-1，則棧
	??已經(jīng)滿，此時(shí)提示無(wú)法執(zhí)行入棧*/
??{printf（“出現(xiàn)錯(cuò)誤！“）;return;}
??else???