栈

栈的简单C实现

#define maxSize 20  
typedef int typename;
typedef struct {
	typename elem[maxSize];
	int top;
}Stack;

//初始化
void initStack(Stack& s){
	s.top = -1;
}

//入栈
void push(Stack& s, typename x){
	if(isFull(){
 		printf("stack is full\n");
 		return;
	}
	s.elem[++top] = x;  //栈顶指针先加1，再进栈
}

//出栈
void pop(Stack& s){
	if(isEmpty(){
		printf("stack is empty\n");
		return;
	}
	typename x = s.elem[s.top--];
}