链表栈 纳尼。。

#include<stdio.h>
#include<malloc.h>
typedef struct node
{
	int date;
	struct node *next;
}node,*pnode;

int creat_node(pnode &s,int number)  //入栈
{
	pnode p;
	s=(pnode)malloc(sizeof(node));
	s->next=NULL;
	printf("put in %d number :",number);
	for(int i = 0;i < number;i++)
	{
		p=(pnode)malloc(sizeof(node));
		scanf("%d",&p->date);
		p->next=s->next;
		s->next=p;		
	}
	return 1;
}
int put_node(pnode &s)
{
	pnode l;
	l=s->next;
	while(l!=NULL)
	{
		printf("%d ",l->date);
		l=l->next;
	}
	printf("\n");
	return 1;
}
int main()
{
	pnode s;
	int a;
	printf("in put number:");
	scanf("%d",&a);
	creat_node(s,a);
	put_node(s);
	return 0;
}