#include"stdio.h" #include"stdlib.h" typedef struct node { int data; struct node *next; }node,*NODE; main() { node *head; head=(NODE)malloc(sizeof(node)); head->next=NULL; head->data=1; while(head->data) { scanf("%d",&head->data);

head=head->next; }

}//運行沒錯但在輸入數據之後就會出錯，是不是鏈的結構有問題？？？

//我晕，你写的乱78招，  也不能你要实现什么功能，  下面是我的：能正确运行



#include"stdio.h"
#include"malloc.h"
#include"stdlib.h"
typedef struct node
   {  int data;
      struct node *next;
   }NODE;
main()
{   NODE *head,*p,*s;
    int ch;
    int x=1;
    head=(NODE*)malloc(sizeof(NODE));
    p=head;
    while(x)
    {  scanf("%d",&ch);
       if(ch!=0)
       { s=(NODE*)malloc(sizeof(NODE));
         s->data=x;
         p->next=s;
         p=s;
       }
       else x=0;
    }
    p->next=NULL;
    p=head;
    head=head->next;
    while(p!=NULL)
    { printf("%d",p->data);
      p=p->next;
    }
    free(p);
}

#include"stdio.h" #include"stdlib.h" typedef struct node { int data; struct node *next; }node,*NODE; main() { node *head,*h,*w; head=(NODE)malloc(sizeof(node)); head->next=NULL; w=head; h=(NODE)malloc(sizeof(node)); h->data=1; while(h->data) { h=(NODE)malloc(sizeof(node)); scanf("%d",&h->data); head->data=h->data; head->next=h; head=h; } head->next=NULL; while(w->next!=NULL) { printf("%d",w->data); w=w->next; }

} 天空你的输出好像不对啊

#include <stdio.h> #define NULL 0 #define N 10 typedef struct node { int data; struct node * next; }node;

void main() { node *p,*q; int num=0; p=(node *)malloc(sizeof(node)); p->next=NULL; while(num<10) { q=(node *)malloc(sizeof(node)); //p->next=q; scanf("%d",&q->data); q->next=p->next; p->next=q; num++; } while(num>0) { p=p->next; printf("%3d",p->data); num--; } getch(); } //我都　来,haha!!!