顺序栈的相关操作

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

#define MAX 100

//栈的数据类型
typedef struct
{
	char name[20];
	float score;
}SElemType;

//顺序栈的存储结构
typedef struct stack
{
	SElemType *data;
	int top;		 //指示栈顶的位置
	int stackSize;	//栈的容量
}SqStack;

//1.栈的初始化
int initSqStack(SqStack *S,int max)
{
	S->data=(SElemType *)malloc(max*sizeof(SElemType));
	if(!S->data){printf("空间申请失败!");exit(0);}
	S->top=-1;
	S->stackSize=max;
	return 1;
}

//2.判断栈空
int SqStackEmpty(SqStack S)
{
	if(S.top=-1) return 0;  //栈空返回0
	else return 1;  
}

//3.获取栈顶元素
int SqStackGetTop(SqStack S,SElemType *e)
{
	if(SqStackEmpty(S)) return 0;//栈空
	*e=S.data[S.top];
	return 1;
}

//4.求栈的长度
int SqStackLength(SqStack S)
{
	return S.top+1;
}

//5.进栈
int Push(SqStack *S,SElemType e)
{
	if(S->stackSize==S->top+1) return 0;
	S->top++;
	S->data[S->top]=e;
	return 1;
}

//6.出栈
int Pop(SqStack *S,SElemType *e)
{
	if(SqStackEmpty(*S)) return 0;
	*e=S->data[S->top];
	S->top--;
	return 1;
}

//7.遍历
int SqStackTraverse(SqStack S)
{
	int k;
	if(SqStackEmpty(S)){ return 0;}
	
	for(k=S.top;k>=0;k--)
	{printf("%s %7.2f\n",S.data[k].name,S.data[k].score);}
	return 1;
}

//8.创建栈
void createSqStack(SqStack *S,int max)
{
	SElemType x;
	int yn;
	initSqStack(S,max);
	do{
		printf("请输入进栈的学生数据:");
		scanf("%s%f",x.name,&x.score);
		Push(S,x);
		printf("继续输入吗？yes=1,no=0:");
		scanf("%d",&yn);
	}while(yn);

}

int main()
{
	SqStack S;
	SElemType e1,e2,e3,e4,etop;
	strcpy(e1.name,"A");
	strcpy(e2.name,"B");
	strcpy(e3.name,"C");
	strcpy(e4.name,"D");
	e1.score=87.44;
	e2.score=69.22;
	e3.score=56.33;
	e4.score=89.22;
//	createSqStack(&S,10);
	initSqStack(&S,10);
	Push(&S,e1);Push(&S,e2);Push(&S,e3);Push(&S,e4);

	SqStackTraverse(S);
	printf("当前栈长：%d\n",SqStackLength(S));
	
	SqStackGetTop(S,&etop);
	printf("栈顶元素%s,%7.2f：\n",etop.name,etop.score);


	Pop(&S,&etop);
	SqStackTraverse(S);
	printf("当前栈长：%d\n",SqStackLength(S));
}

运行结果