我有一个实验室任务，我们必须创建一个链表。我已经编写了实现此目的的方法。我希望能够在测试时打印出我的链表。我有一个应该遍历所有节点的while循环，但测试条件总是失败，我不知道为什么。我将测试用例放入以查看是否每当我将节点推送到列表中时，新的头是否为空。这是我的链表的代码：
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "list.h"
struct lnode {
char* word;
int count;
int line;
struct lnode* next;
};
struct lnode* head = NULL;
struct lnode* newNode(char *word, int line) {
struct lnode* tempnode;
char* new = word;
tempnode = (struct lnode *)malloc(sizeof(struct lnode));
tempnode->word = new;
tempnode->count = 1;
tempnode->line = line;
return tempnode;
}
void pushNode(struct lnode** head, struct lnode* node) {
if(head == NULL) {
head = node;
head = nodeGetNext(head);
head = NULL;
}
else {
node->next = head;
node = nodeGetNext(node);
node = head;
}
}
struct lnode* nodeGetNext(struct lnode* node) {
return node->next;
}
char* nodeGetWord(struct lnode* node) {
return node->word;
}
int main() {
struct lnode* a;
struct lnode* b;
struct lnode* c;
struct lnode* d;
struct lnode* e;
a = newNode("Hello", 0);
b = newNode("Bonjour", 1);
c = newNode("Hola", 2);
d = newNode("Bonjourno", 3);
e = newNode("Hallo", 4);
pushNode(head, a);
if(head == NULL)
printf("YES");
pushNode(head, b);
if(head == NULL)
printf("YES");
pushNode(head, c);
if(head == NULL)
printf("YES");
pushNode(head, d);
if(head == NULL)
printf("YES");
pushNode(head, e);
if(head == NULL)
printf("YES");
printList();
return 0;
}
void printList() {
printf("Hello\n");
struct lnode *currentnode;
currentnode = head;
while (currentnode != NULL) {
printf("Hello");
printf("%s:\n",nodeGetWord(currentnode));
currentnode = nodeGetNext(currentnode);
}
}