曾经写过一个复杂的算法,如下:
stu* shuru()
{
int n;
stu*preheadptr=NULL,*headptr=NULL,*currentptr=NULL,*lastptr=NULL;
scanf("%d",&n);
while(n!=-1)
{
currentptr=(stu*)malloc(sizeof(stu));
currentptr->data=n;
if(currentptr!=NULL)
{
if(headptr==NULL)
{
headptr=currentptr;
lastptr=currentptr;
}
else
{
lastptr->nextptr=currentptr;
lastptr=currentptr;
}
scanf("%d",&n);
}
}
lastptr->nextptr=NULL;
preheadptr=(stu*)malloc(sizeof(stu));
preheadptr->nextptr=headptr;
return preheadptr;
}//读入一组数据,以-1结束。
该算法的麻烦之处是先读入数据,再添加头结点,而且还有headptr是否为NULL的判断。
然后来一个简单一点的算法:
Stu* input(int n)
{
Stu *head = NULL,*current=NULL,*pre=NULL;
pre = (Stu*)malloc(sizeof(Stu));
head = pre;
for (int i = 0; i <= n - 1; i++)
{
current = (Stu*)malloc(sizeof(Stu));
cout << "请输入学生" << (i + 1) << "的学号,姓名,成绩" << endl;
cin >> current->data.num >> current->data.name >> current->data.score;
pre->next = current;
pre = current;
}
pre->next = NULL;
return head;
}/输入n个学生的学号,姓名,成绩
该算法一开始就设置好头结点,从头结点开始移动,最后一个节点指向NULL,再返回头结点即可。这样就更加直接。