S.elem = (ElemType *)malloc(size * sizeof(ElemType));

if (NULL == S.elem) return OVERFLOW;

S.top = 0;

S.size = size;

S.increment = inc;

return OK;

free(S.elem);

S.elem = NULL;

return OK;

if (0 == S.top) return;

S.size = 0;

S.top = 0;

ElemType *newbase;

if (S.top >= S.size) {

newbase = (ElemType *)realloc(S.elem, (S.size + S.increment) * sizeof(ElemType));

if (NULL == newbase) return OVERFLOW;

S.elem = newbase;

S.size += S.increment;

}

S.elem[S.top++] = e;

return OK;

if (0 == S.top) return ERROR;

e = S.elem[S.top - 1];

return e;

if (0 == S.top) return ERROR;

e = S.elem[S.top - 1];

S.top--;

return e;

//定义栈S

SqSrack S;

//定义测量值

int size, increment, i;

//初始化测试值

size = LONGTH;

increment = LONGTH;

ElemType e, eArray[LONGTH] = { 1, 2, 3, 4, 5 };

//显示测试值

printf("---【顺序栈】---\n");

printf("栈S的size为：%d\n栈S的increment为：%d\n", size, increment);

printf("待测试元素为：\n");

for (i = 0; i < LONGTH; i++) {

printf("%d\t", eArray[i]);

}

printf("\n");

//初始化顺序栈

if (!InitStack_Sq(S, size, increment)) {

printf("初始化顺序栈失败\n");

exit(0);

}

printf("已初始化顺序栈\n");

//入栈

for (i = 0; i < S.size; i++) {

if (!Push_Sq(S, eArray[i])) {

printf("%d入栈失败\n", eArray[i]);

exit(0);

}

}

printf("已入栈\n");

//判断非空

if(StackEmpty_Sq(S)) printf("S栈为空\n");

else printf("S栈非空\n");

//取栈S的栈顶元素

printf("栈S的栈顶元素为：\n");

printf("%d\n", GetTop_Sq(S, e));

//栈S元素出栈

printf("栈S元素出栈为：\n");

for (i = 0, e = 0; i < S.size; i++) {

printf("%d\t", Pop_Sq(S, e));

}

printf("\n");

//清空栈S

ClearStack_Sq(S);

printf("已清空栈S\n");

return 0;