//学习日记
#include<stdio.h>
#include<malloc.h>
typedef struct node
{
int data;
struct node *next;
}node01,*node02;
typedef node02 list;
int main()
{
list head,p1,p;
head=p=p1=(list)malloc(sizeof(node01));
int len;
printf("请输入链表长度:\n");
scanf("%d\n",&len);
int i=0;
printf("\n请给头结点赋值\n");
scanf("%d",&p->data);
while(getchar()!='\n'&&i<len-1)
{
p=(list)malloc(sizeof(node01));
scanf("%d",&p->data);
p1->next=p;
p1=p;
if(i==len)
{
break;
}
else
{
i++;
}
}
p->next=NULL;
p=head;
while(p)
{
printf("%d",p->data);
p=p->next;
}
return 0;
}
/*仅供学习交流*/