栈(未通过poj验证)

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


typedef int type;


typedef struct linkedlist{
type data;
struct list *next;
}linkedliststruct,*linkedlist;


typedef struct stack{
int size;
struct list *top;
}stackstruct,*stack;


stack init(stack *s){
*s = (stack)malloc(sizeof(stackstruct));
(*s)->size = 0;
(*s)->top = NULL;
return *s;
}


void push(stack s,type data){
s->size ++;
linkedlist new = (linkedlist)malloc(sizeof(linkedliststruct));
new->data = data;
new->next = s->top;
s->top = new;
}


type pop(stack s){
linkedlist top,next;
if (s->size == 0){
printf("error!!!\n");
exit(0);
}
top = s->top;
next = top->next;
type data = top->data;
free(top);
s->top = next;
s->size--;
return data;
}




int main(){
stack s;
init(&s);
printf("%d\n",s->size);
push(s,0);
printf("%d\n",s->size);
push(s,1);
printf("%d\n",pop(s));
printf("%d\n",pop(s));
printf("%d\n",pop(s));


    return 0;
}