（在输出位置意外中断，程序功能是输入姓名和学号，然后在首位再插入一个学生，然后输出整个链表，中断位置在输出函数的第一次姓名输出）
#include
#include
struct Student
{
char cName;
int iNumber;
struct Student *pNext;
};
int iCount;
struct Student *Create()
{
struct Student *pHead=NULL;
struct Student *pEnd,*pNew;
printf("Plase enter Name first,then Number:\n");
pEnd=pNew=malloc(sizeof(struct Student));
scanf("%s",&pNew->cName);
scanf("%d",&pNew->iNumber);
while(pNew->iNumber!=0)
{
iCount++;
if(iCount==1)
{
pNew->pNext=NULL;
pEnd=pNew;
pHead=pNew;
}
else
{
pNew->pNext=NULL;
pEnd->pNext=pNew;
pEnd=pNew;
}
pNew=malloc(sizeof(struct Student));
scanf("%s",&pNew->cName);
scanf("%d",&pNew->iNumber);
}
free(pNew);
return pHead;
};
void Print(struct Student *pHead)
{
struct Student *pTemp;
int iIndex=1;
printf("the list has %d members\n\n",iCount);
pTemp=pHead;
while(pTemp!=NULL)
{
printf("No.%d student:\n",iIndex);
printf("accomplished");
printf("Name:%s",pHead->cName);
printf("Number:%d\n",pTemp->iNumber);
pTemp=pTemp->pNext;
iIndex++;
}
};
struct Student *Insert(struct Student *pHead)
{
struct Student *pInsert;
printf("Insert member at first\n");
pInsert=malloc(sizeof(struct Student));
scanf("%s",&pInsert->cName);
scanf("%d",&pInsert->iNumber);
pInsert->pNext=pHead->pNext;
pHead->pNext=pInsert;
iCount++;
return pHead;
};
main()
{
struct Student *pHead;
printf("readng...\n");
pHead=Create();
printf("Insert readying\n");
pHead=Insert(pHead);
printf("\nInsert accomplished\n");
Print(pHead);
return 0;
}
