c - C-链表的addLast函数的怪异行为

我在C中创建了一个链表数据结构。但是，我在addLast函数的实现中收到了一些奇怪的行为在我下一次调用addLast之前，添加的元素似乎不会出现。我的代码（我将通过内联注释解释我认为我的代码是如何工作的）：
帮助程序代码：

typedef struct LinkedList linkedlist;
typedef int ListElement;

struct LinkedList{
  ListElement data;
  linkedlist *next;
};

//Initializes a list;
void CreateList(linkedlist *list, ListElement contents){
  list->data = contents;
  list->next = NULL;
}

//Prints the items of the list, head first.
void displayList(linkedlist *list){
  printf("(%d", list->data);
  linkedlist *node = list->next;

  if(node == NULL){
  }
  else{
    while(node->next != NULL){
      printf(" %d", node->data);
      node = node->next;
    }
  }

  printf(")");
}

有问题的代码：

//Adds an element at the tail of the list
void addLast(linkedlist *list, ListElement forAdding){
  linkedlist *node = list;
  linkedlist *NewNode = (linkedlist *) malloc(sizeof(linkedlist));

  //Go to the last element in the list
  while(node->next != NULL){
    node = node->next;
  }

  //Prepare the node we will add
  NewNode->data = forAdding;
  NewNode->next = NULL;

  //Since node is pointing to the tail element, set its
  //next to the NewNode---the new tail
  node->next = NewNode;
}

//Special attention to this function!
void List(ListElement items[], linkedlist *list, int numItems){
  int i = 0;

  while(i < numItems){
    addLast(list, items[i]);
    printf("Before ");
    displayList(list);
    printf("\n");
    printf("Added %d", items[i]);
    displayList(list);
    printf("\n");
    i++;
  }
}

主要功能：

int main(){
  linkedlist *l= (linkedlist *) malloc(sizeof(linkedlist));
  CreateList(l, 0);
  int a_list[5] = {1, 2, 3, 5, 6};
  List(a_list, l, sizeof(a_list)/sizeof(a_list[0]));
  printf("A list of five elements: %d", sizeof(a_list)/sizeof(a_list[0]));
  displayList(l);
  removeLast(l);
  addLast(l, 7);
  printf("\nAdded something at last position: ");
  displayList(l);
  printf("\n");
}

我得到输出：

Before (0)
Added 1(0)
Before (0)
Added 2(0 1)
Before (0 1)
Added 3(0 1 2)
Before (0 1 2)
Added 5(0 1 2 3)
Before (0 1 2 3)
Added 6(0 1 2 3 5)
A list of five elements: 5(0 1 2 3 5)
Added something at last position: (0 1 2 3 5 6)

如您所见，添加的项似乎只会出现在我下一次调用addLast时。
到目前为止，我已经发现它实际上就在那里，尽管出于某种原因它不会被印刷出来例如，如果我在关闭函数列表之前执行另一个addLast(list, 6);调用（当然是在循环之外！），输出行Added something at last position...（在调用addLast(l, 7);之后发生）将实际显示Added something at last position: (0 1 2 3 5 6 6)。
那么，我做错什么了？
谢谢！

最佳答案

问题不在AddLast()中，而在于您的displayList()函数：）在最后一个元素之前停止打印1个元素。
将displayList()函数更改为：

void displayList(linkedlist *list){
  printf("(");
  linkedlist *node = list;

  while(node != NULL){
    printf(" %d", node->data);
    node = node->next;
  }

  printf(")");
}

此函数也可以打印空列表。

关于c - C-链表的addLast函数的怪异行为，我们在Stack Overflow上找到一个类似的问题：https://stackoverflow.com/questions/6623664/