堆栈的顺序存储实现

堆栈的顺序存储

#include<iostream>
using namespace std;
#define MAXSIZE 100
typedef struct SNode* Stack;
typedef int ElementType;
struct SNode{
	ElementType Data[MAXSIZE];
	int top;
};

//1.入栈操作
void Push(ElementType item,Stack PtrS); 
//2.出栈操作
ElementType Pop(Stack PtrS);
//3.判断栈空
int IsEmpty(Stack PtrS); 
 
int main(){
	Stack PtrS=(Stack)malloc(sizeof(SNode));
	PtrS->top=-1;
	Push(1,PtrS);
	Push(2,PtrS);
	Push(3,PtrS);
	Push(4,PtrS);
	cout<<Pop(PtrS)<<endl;
	cout<<Pop(PtrS)<<endl;
	cout<<Pop(PtrS)<<endl;
	cout<<Pop(PtrS)<<endl;
	Pop(PtrS);
	return 0;
}
//入栈 
void Push(ElementType item,Stack PtrS){
	if(PtrS->top==MAXSIZE-1){
		printf("栈满");
		return; 
	}else{
		PtrS->Data[++(PtrS->top)]=item;
		return;
	}
}
//出栈 
ElementType Pop(Stack PtrS){
	if(PtrS->top==-1){
		printf("栈空");
		return NULL;
	}else{
		return PtrS->Data[(PtrS->top)--];
	}
}