顺序栈代码

#include<stdio.h>
#include<stdlib.h>

#define MAXSIZE 50
#define true 1
#define OK 1
#define false 0
#define Error 0

typedef int Status;
typedef int Elemtype;
typedef struct sqStack {
	Elemtype data[MAXSIZE];
	int top;
}sqStack;
/*栈的初始化*/
Status InitStack(sqStack* s) {
	s->top = -1;
	return OK;
}
/*判断栈空*/
Status isEmpty(sqStack s)
{
	if (s.top == -1)
		return true;
	else
		return false;
}
/*栈置空*/
Status MakeEmptytack(sqStack* s)
{
	s->top = -1;
	return OK;
}
/*返回栈顶元素*/
Status GetTop(sqStack s, Elemtype* e) {
	if (s.top == -1)
		return Error;
	else
		*e = s.data[s.top];
	return OK;
}
/*进栈*/
Status Push(sqStack* s, Elemtype  e) {
	if (s->top == MAXSIZE - 1)
		return Error;
	else
		s->top++;				/* 栈顶指针增加一 */
	s->data[s->top] = e;  /* 将新插入元素赋值给栈顶空间 */
	return OK;
}
/*出栈*/
Status Pop(sqStack* s, Elemtype* e) {
	if (s->top == -1)
		return Error;
	else
		*e = s->data[s->top];	/* 将要删除的栈顶元素赋值给e */
	s->top--;
	return OK;
}
/*从栈顶到栈底打印*/
Status PrintfStack(sqStack s) {
	int i = s.top;
	int j = s.top;
	while (i >= 0) {
		int t = i;
		printf("%d\n", s.data[t--]);
		i--;
	}
	return OK;
}

int main() {
	sqStack s;
	int e;
	InitStack(&s);
	for (int j = 1;j <= 10;j++) {
		Push(&s, j);
	}
	PrintfStack(s);
	Pop(&s, &e);
	printf("弹出的栈顶元素 e=%d\n", e);
	printf("栈空否：%d(1:空 0:否)\n", isEmpty(s));
	GetTop(s, &e);
	printf("弹出栈顶后的栈顶元素 e=%d\n", e);
	MakeEmptytack(&s);
	printf("栈空否：%d(1:空 0:否)\n", isEmpty(s));
	return 0;
}

调试结果：