我正在制作一个单链表,其节点有一个字符串和一个指向下一个节点的指针。我已经编写了一个插入到链表前面的函数。问题是每当我向链表插入一个新值时,它都会改变所有节点的值。我不知道我哪里错了。请帮忙。这是代码
#include <stdio.h>
#include <stdlib.h>
typedef struct Elem {
char *word;
struct Elem *next;
} Elem;
void printList (Elem **list)
{
if(!(*list)){
printf("List is empty");
return ;
}
Elem *curr;
curr = *list;
while(curr)
{
printf("%s -- ",(curr)->word);
curr = (curr)->next;
}
}
void insert_in_front(Elem **list, char *value)
{
if(!*list)
{
printf("List is empty... creating first node\n");
(*list) = (Elem*) malloc(sizeof(Elem));
(*list)->word = value;
(*list)->next = NULL;
return ;
}
printf("The word in list is %s\n",(*list)->word);
Elem *curr = (Elem*) malloc(sizeof(Elem));
if(!curr)
exit(-1);
curr->word = value;
curr->next = (*list);
printf("the address of curr is : 0x%x\n",curr);
(*list) = curr;
printf("the address of list is : 0x%x\n",(*list));
}
int main(void)
{
Elem *newList;
newList = NULL;
char inp[15];
while(1)
{
printf("Enter the string : ");
scanf("%s",&inp);
printf("input is %s",inp);
printf("\nthe address of newList is : 0x%x\n",newList);
insert_in_front(&newList, &inp);
printf("the address of newList is : 0x%x\n",newList);
printList(&newList);
printf("the address of newList is : 0x%x\n",newList);
printf("\n");
}
return 0;
}
您可以复制粘贴代码以运行。输出如下: 请原谅调试消息。我只是想看看每次插入后指针是否指向新位置。
Enter the string : hello
input is hello
the address of newList is : 0x0
List is empty... creating first node
the address of newList is : 0x251b010
hello -- the address of newList is : 0x251b010
Enter the string : world
input is world
the address of newList is : 0x251b010
The word in list is world
the address of curr is : 0x251b030
the address of list is : 0x251b030
the address of newList is : 0x251b030
world -- world -- the address of newList is : 0x251b030
Enter the string : testing
input is testing
the address of newList is : 0x251b030
The word in list is testing
the address of curr is : 0x251b050
the address of list is : 0x251b050
the address of newList is : 0x251b050
testing -- testing -- testing -- the address of newList is : 0x251b050
Enter the string :
提前致谢!