#include<stdio.h>
#include<stdlib.h>
struct list
{
    int num;
    struct list *node;
};
main(void)
{
    struct list *head,*p,*tail;
    head=NULL;
    do
    {
        p=(struct list *)malloc(sizeof(struct list));
        if(p==NULL)
        {
            printf("Memonry alloc failed\n");
            exit(0);
        }
        printf("Input num\n");
        scanf("%d",&p->num);
        if(p->num==0)
        {
            free(p);
            break;
        }
        p->node=NULL;
        if(head==NULL)
        {
            head=p;
            tail=p;
        }
        else
        {
            tail->node=p;
            tail=p;
        }
    }while(p->num!=0);
        p=head;
        while(p!=NULL);
        {
            printf("%d",p->num);
            p=p->node;
        }
        printf("\n");
    }
   

帮你简单改了下,你最马虎的地方是在输出时的 while 循环语句的后面加上了分号,导致死循环:

#include<stdio.h>
#include<stdlib.h>
struct list
{
    int num;
    struct list *node;
};
main()
{
    struct list *head,*p,*tail;
    head=NULL;
    do
    {
        p=(struct list *)malloc(sizeof(struct list));
        if(p==NULL)
        {
            printf("Memonry alloc failed\n");
            exit(0);
        }
        printf("Input num\n");
        scanf("%d",&p->num);
        //p->node=NULL;
        if(head==NULL)
        {
            head=p;
            tail=p;
        }
        else
        {
            tail->node=p;
            tail=p;
        }
     if(p->num==0)
        {
        p->node=NULL;
            //free(p);
            break;
        }
    }while(1);
   // tail->node=NULL;
        p=head;
        while(p->node!=NULL)
        {
            printf("%d ",p->num);
            p=p->node;
        }
        printf("\n");
    }

嗯,谢谢了,我当时是好不容易想 清楚了算法,不是很确定是否正确就写了程序,太慌张了