我在向单链表添加节点时遇到了问题,因为某些原因当列表为空时,
if(current->next == NULL)
将被跳过,这会在我显示列表时导致一个段错误... 我真的很困惑为什么它会被跳过,有什么想法吗?
void addToList(node** head, char name[30], int groupSize, boolean inRest){
//create new node
node *newNode = (node*)malloc(sizeof(node));
if (newNode == NULL) {
fprintf(stderr, "Unable to allocate memory for new node\n");
exit(-1);
}
InitNodeInfo(newNode, name, groupSize, inRest);
node *current = head;
//check for first insertion
if (current->next == NULL) {
current->next = newNode;
printf("added at beginning\n");
} else {
//else loop through the list and find the last
//node, insert next to it
while (current->next != NULL) {
current = current->next;
}
current->next = newNode;
printf("added later\n");
*head = current;
}
if (debug == FALSE) { //debug mode...
printf("Pushed the value %d on to the stack\n", groupSize);
} else {
printf("\n\nATTENTION : Group cannot be added, the name entered already exists!\n\n");
}
}
head
和current
的类型。也许你想要node *current = *head;
。那么当你在开头添加它时会发生什么?目前你只是打印,但没有重新分配/移动head
。实际上,在另一种情况下你这样做了... - Pynchiahead
指向NULL
还是始终存在一个虚拟元素在开头?(即head
指向一个虚拟元素) - Pynchianode * head = NULL;
。 - user5464683