pop.c

堆栈的基本功能实现,数组方式实现

#include "head.h"
int pop(int s[],int top,int *q)
{
	
    if(top == 0)
    {   printf("stack empty\n");
        return(0);
    }
	*q = s[top - 1];
	return(--top);
	
}