# include <stdio.h>
# include <stdlib.h>
# include <malloc.h>
typedef struct Node
{
int num;
struct Node * pNext;
}Node;
Node * creatlist()
{
int val,len,i;
Node * pHead,*pNext,*pTail;
pHead = (Node *)malloc(sizeof(Node));
if(pHead == NULL)
{
printf("creating memory is fail\n");
exit (-1);
}
pTail = pHead;
pTail->pNext = NULL;
printf("輸入所要建立連結串列個數：");
scanf ("%d",&len);
i = 1;


while (i <= len)
{
Node * pNew = (Node *)malloc (sizeof(Node));
if(pNew==NULL)
{
printf("creating memory is fail\n");
exit (-1);
}
printf("輸入第%d節點的值 ：",i);
scanf("%d",&val);


pNew->num = val;
pNew->pNext = NULL;
pTail->pNext = pNew;
pTail = pNew;
i++;

}
return(pHead);


}
/* 
void traverse_list(Node * pHead)
{
Node * p;
p = pHead->pNext； 
while (1)
{
printf("%d",p->num);
p = p->pNext;
if(p->pNext == NULl)
{
break;
}
}
*/
void prlist(struct Node * pHead)
{
struct Node * p = pHead->pNext;


while (NULL != p)
{
printf("%d ", p->num);
p = p->pNext;
}
printf("\n");

return;
}






int main (void)
{
Node * pHead;
pHead = creatlist(); 
prlist(pHead);




system("pause");
return 0;
}
/*
2014年6月1日 12:16:27 
by zhao 
*/