#include<stdio.h>
#include<stdlib.h>
main()
{
int n;
typedef struct stu
{
int i;
struct stu *next;
}stu;
typedef struct head
{
stu *he;
int size;
}head;
head *p;
stu *p1;
stu *p2;
stu *p3;
p=(head*)malloc(sizeof(head));
if(p==NULL)
{
printf("shengqingshibai\n");
return (NULL);
}
(*p).he=p2=NULL;
(*p).size=0;
printf("please shurushuju:\n");
scanf("%d",&n);
while(n!=0)
{
p1=(stu*)malloc(sizeof(stu));
if(p1==NULL)
{
printf("shengqingshibai\n");
return (NULL);
}
(*p1).next=NULL;
if((*p).size==0)
{
(*p).he=p1;
p2=p1;
}
else
{
(*p2).next=p1;
p2=p1;
}
(*p1).i=n;
(*p).size++;
printf("qingshurushuju:\n");
scanf("%d",&n);
}
printf("shurushujujiesu\n");
printf("%d\n",(*p).size);
p3=(*p).he;
while(p3!=NULL)
{
 printf("%d\n",(*p3).i);
 p3=(*p3).next;
}
}

自己做的，花了好长时间  还能优化么？
#include<stdio.h>
#include<stdlib.h>
typedef struct stu
{
int i;
struct stu *next;
}stu; /*数据结构体*/

typedef struct head
{
stu *he;
int size;
}head;/*链表头文件信息存放*/


void dayin(stu *p3) /*打印出链表内容*/
{
while(p3!=NULL)
{
 printf("%d\n",(*p3).i);
 p3=(*p3).next;
}
}

head *creatlist() /*建立一个链表的起始位置*/
{
    head *p;
p=(head*)malloc(sizeof(head));
if(p==NULL)
{
printf("shengqingshibai\n");
return (NULL);
}
(*p).he=NULL;
(*p).size=0;
return p;
}
stu *creatnum() /*建立一个链表的成员*/
{
    stu *p1;
    p1=(stu*)malloc(sizeof(stu));
if(p1==NULL)
{
printf("shengqingshibai\n");
return (NULL);
}
(*p1).next=NULL;
return p1;
}

stu *lianjieshuju(head *p,stu *p1,stu *p2) /*将新建立数据连接到表尾巴*/
{
if((*p).size==0)
{
(*p).he=p1;
p2=p1;
}
else
{
(*p2).next=p1;
p2=p1;
}
return p2;
}

main()  /*主体*/
{
head *p;
stu *p1;
stu *p2;
stu *p3;
int n;
p=creatlist();  
printf("please shurushuju:\n");
scanf("%d",&n);
while(n!=0)            /*约定n=0时结束输入数据*/
{
p1=creatnum();
p2=lianjieshuju(p,p1,p2);
(*p1).i=n;
(*p).size++;
printf("qingshurushuju:\n");
scanf("%d",&n);
}
printf("shurushujujiesu\n");
printf("%d\n",(*p).size); /*显示链表长度*/
p3=(*p).he;
dayin(p3);
}