单链表的建立，求长度，打印

//定义一个单链表
typedef struct student
{
     int data;
     struct student *next;
}node;

node *create()
{
   node *p,*s,*head;
   int x,cycle = 0;
   head = (node*)malloc(sizeof(node));
   p = head;
   while(cycle)
   {
      printf("please enter your data:\n");
      scanf("%d",&x);
      if(x!=0)//输入0则结束输入
      {
         s = (node*)malloc(sizeof(node));
         s->data = x;
         p->next = s;
         p=s;
      } 
             else
             {
             	 cycle = 0;
             } 
   } 
          
      head = head ->next;//没有这句头结点中未存放数据
      p->next = NULL;
     return head;
}