实现单向链表创建与输出：添加节点及打印功能解析

```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) { head = newNode; } else { Link temp = head; while (temp->next != NULL) { temp = temp->next; } temp->next = newNode; } return head; } // 输出链表 void DisplyNode(Link head) { if (head == NULL) { printf("NULL"); } else { Link temp = head; printf("%d", temp->data); temp = temp->next; while (temp != NULL) { printf(",%d", temp->data); temp = temp->next; } } } ``` ######[AI问答 | 354点数解答 | 2025-12-19 22:00:13]