c 链表简单描述 链表是一种物理储存单元上无序的储存结构分为数据域和指针域(指向下一个结构的指针) #include <stdio.h> #include <stdlib.h> struct book { long total; int price; struct book *next; }; struct book *input() { int total = 0; int price = 0; struct book *current = malloc(sizeof(struct book)); puts("enter total:"); scanf("%d", &total); puts("enter price:"); scanf("%d", &price); current->total = total; current->price = price; current->next = NULL; return current; } int main(void) { struct book *head = NULL, *current, *prev;/*用来保存上一个结构指针*/ for (int i = 0; i < 3; ++i) { current = input(); if (head == NULL) head = current; else prev->next = current; prev = current; } current = head; for (int j = 0; j < 3; ++j) { printf("total: %d price: %d\n", current->total, current->price); current = current->next; } return 0; }