遇到一个链表问题，一直都没想明白，希望各位达人帮小弟看看，并指点一下。
目前是想在链表末尾添加一个新的节点
typedef struct list
{
int data;
struct list *node;
}sequence_list;
void add(sequence_list *startp)
{
sequence_list *add,*pre_node;
int add_data;
scanf(“%d”,&add_data);
pre_node=startp;
//
add=(sequence_list *)malloc(sizeof(sequence_list));
add->data=add_data;
add->node=NULL;
//–创建一个新的节点
while(pre_node->node)
{
pre_node=pre_node->node;
}
pre_node->node=add;//循环到最后的NULL，然后把add这个节点添加到末尾。
pre_node=startp;
puts(“New the list is:”);
do
{
printf(“%d “,pre_node->data);
pre_node=pre_node->node;
}while(pre_node->node);
}
不知道为什么在输出结果的时候添加在末尾的那个节点输出的值有问题。麻烦各位告知小弟这个问题是出在那里，非常感激！
>> 本文固定链接: http://www.vcgood.com/archives/2479
这是我以前研究书上的一个例子 希望对你有帮助 有问题再说
#include <malloc.h>
#define NULL 0
#define LEN sizeof(struct student)
struct student
{
long id;
float score;
struct student *next;
};
int n; /*全局变量，记录结点数*/
struct student *creat(void) /*链表创建*/
{
struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=(struct student *)malloc(LEN);
scanf(“%ld,%f”,&p1->id,&p1->score);
head=NULL;
while(p1->id!=0)
{
n++;
if(n==1)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct student *)malloc(LEN);
scanf(“%ld,%f”,&p1->id,&p1->score);
}
p2->next=NULL;
return (head);
}
void print(struct student *head) /*输出链表*/
{
struct student *p;
printf(“\nNow,the %d records are: \n”,n);
p=head;
if(head!=NULL)
{
do
{
printf(“%ld %5.1f\n”,p->id,p->score);
p=p->next;
}while(p!=NULL);
}
}
struct student *del(struct student *head,long num) /*删除结点函数*/
{
struct student *p1,*p2;
if(head==NULL)
{
printf(“\nList null!\n”);
/*goto end; 生平第一次用*/
}
p1=head;
while(num!=p1->id && p1->next!=NULL)
{
p2=p1;
p1=p1->next;
}
if(num==p1->id) /*删除点*/
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
printf(“delete:%d\n”,num);
n–;
}
else
printf(“%ld is not been found!\n”,num);
return(head);
}
struct student *insert(struct student *head,struct student *stud) /*插入结点*/
{
struct student *p0,*p1,*p2;
p1=head;
p0=stud;
if(head==NULL)
{
head=p0;
p0->next=NULL;
}
else
{
while((p0->id > p1->id) && (p1->next!=NULL))
{
p2=p1;
p1=p1->next;
}
if(p0->id <= p1->id)
{
if(head==p1)
{
head=p0;
p0->next=p1;
}
else
{
p2->next=p0;
p0->next=p1;
}
}
else
{
p1->next=p0;
p0->next=NULL;
}
}
}
main()
{
struct student *head,*stu;
long del_id;
printf(“input records:\n”);
head=creat();
print(head);
printf(“\ninput the deleted id:”);
scanf(“%ld”,&del_id);
while(del_id!=0)
{
head=del(head,del_id);
print(head);
printf(“input the deleted id:”);
scanf(“%ld”,&del_id);
}
printf(“\ninput the record:”);
stu=(struct student *)malloc(LEN);
scanf(“%ld,%f”,&stu->id,&stu->score);
while(stu->id!=0)
{
head=insert(head,stu);
print(head);
printf(“input the inserted record:”);
stu=(struct student *)malloc(LEN);
scanf(“%ld,%f”,&stu->id,&stu->score);
}
}