下面是一个简单的动态链表
1.#include<stdio.h>
#include<stdlib.h>
//创建一个结构体
struct node {
char info[20];
int grade[2];
struct node* link;
};
int main() {
int n, i;
//在结构体中定义指针,用于不同节点之间的链接
struct node* head;
struct node* tail;
struct node* p;
scanf_s("%d", &n);
//创建结构体需要的内存空间
p = (struct node*)malloc(sizeof(struct node));
head = p;
tail = p;
//初始化
head->link = NULL;
//将节点链接起来
for (i = 0; i < n; i++) {
p = (struct node*)malloc(sizeof(struct node));
scanf_s("%s",p->info,sizeof(p->info));
scanf_s("%d", &p->grade[0]);
scanf_s("%d", &p->grade[1]);
tail->link = p;
tail = p;
tail->link = NULL;
}
p = head->link;
while (p != NULL) {
printf("%s:%d %d\n", p->info, p->grade[0], p->grade[1]);
p = p->link;
}
return 0;
}