List实现
1、元素添加
#include <stdio.h> #include <stdlib.h> struct ListNode{ struct ListNode* next; int data; }; typedef struct ListNode node; void AddFront(node** head,node* newnode){ newnode->next = *head; *head = newnode; } void PrintList(node* head) { node* cur = head; if(cur == NULL) printf("Empty List\n"); else{ while(cur != NULL) { if(cur->next == NULL) printf("%d\n", cur->data); else printf("%d->", cur->data); cur = cur->next; } } } int main() { node* head = NULL; int data; int a[] = {1,2,3,4,5}; int len = sizeof(a)/sizeof(int); int i; for(i = 0;i < len; i++ ){ data = a[i]; node* newnode = (node*)malloc(sizeof(node)); newnode->data = data; newnode->next = NULL; AddFront(&head,newnode); } PrintList(head); return 0; }
【推荐】还在用 ECharts 开发大屏?试试这款永久免费的开源 BI 工具!
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步