100分题目：实现单向链表创建与输出，含完整C代码解析

```c #include <stdio.h> #include <stdlib.h> typedef struct link { int data; struct link *next; }*Link; Link AppendNode(Link head, int data); void DisplyNode(Link head); int main() { int data; Link head = NULL; while (1) { scanf("%d", &data); if (data == -1) break; head = AppendNode(head, data); } DisplyNode(head); return 0; } // 向链表尾部添加节点函数 Link AppendNode(Link head, int data) { Link newNode = (Link)malloc(sizeof(struct link)); newNode->data = data; newNode->next = NULL; if (head == NULL) { return newNode; } Link temp = head; while (temp->next != NULL) { temp = temp->next; } temp->next = newNode; return head; } // 输出链表函数 void DisplyNode(Link head) { if (head == NULL) { printf("NULL"); return; } Link temp = head; printf("%d", temp->data); temp = temp->next; while (temp != NULL) { printf(",%d", temp->data); temp = temp->next; } } ``` ######[AI问答 | 351点数解答 | 2025-12-19 20:53:08]