到了堆疊這裡一下子就輕鬆了，算是一種暫時的解脫吧。經過了連結串列部分的學習和思考，我突然意識到嚴蔚敏教材的嚴謹性。下面是按照教材實現的堆疊操作程式碼，唯一有些疑問的是在Pop操作中要不要根據需要縮減堆疊的尺寸呢？

#include <stdio.h>
#include <stdlib.h> 
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define STACK_INIT_SIZE 100
#define STAK_INCREASEMENT 10
typedef int Status;
typedef int SElemType;
typedef struct
{
	SElemType *base;
	SElemType *top;
	int stacksize;
}SqStack;
Status InitStack(SqStack &S);
Status DestroyStack(SqStack &S);
Status ClearStack(SqStack &S);
Status StackEmpty(SqStack S);
int StackLength(SqStack S);
Status GetTop(SqStack &S, SElemType &e);
Status Push(SqStack &S, SElemType e);
Status Pop(SqStack &S, SElemType &e);
int main(void)
{
	SqStack S;
	InitStack(S);
	// Push(S,2);
	int i,j;
	for(i = 0; i<190; i++)
	{
		Push(S,i);
	}
	for(i=0; i<17; i++)
	{
		Pop(S,j);
		printf("%d\t",j);
	}
	system("pause");
}
Status InitStack(SqStack &S)
{
	S.base = (SElemType *)malloc( STACK_INIT_SIZE * sizeof(SElemType) );
	if(!S.base)
		return ERROR;
	S.top = S.base;
	S.stacksize = STACK_INIT_SIZE;
	return OK;
}
Status DestroyStack(SqStack &S)
{
	S.top = S.base;
	free(S.base);
	S.stacksize = 0;
	return OK;
}
Status ClearStack(SqStack &S)
{
	S.top = S.base;
	S.base = (SElemType *)realloc(S.base, STACK_INIT_SIZE * sizeof(SElemType) );
	S.stacksize = 100;
	return OK;
}
Status StackEmpty(SqStack S)
{
	if( S.base == S.top )
		return TRUE;
	return FALSE;
}
Status GetTop(SqStack &S, SElemType &e)
{
	if( S.base == S.top )
		return ERROR;
	e = *(S.top - 1);                // 這裡一定要注意
	return OK;
}
Status Push(SqStack &S, SElemType e)
{
	if( (S.top - S.base) >= S.stacksize )
	{
		S.base = (SElemType *)realloc(S.base, ( S.stacksize + STAK_INCREASEMENT ) * sizeof(SElemType));
		S.stacksize += STAK_INCREASEMENT;
		if(!S.base)
			return ERROR;
	}
	*S.top = e;
	S.top++;
	return OK;
}
Status Pop(SqStack &S, SElemType &e)
{
	if(S.base == S.top)
		return ERROR;
	S.top--;
	e = *S.top;
	return OK;
}
 

感謝下方留言的朋友指出我的錯誤。