#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
typedef struct node
{
struct node *prev;
int data;
struct node *next;
}NODE, * PNODE;
PNODE header; //头结点
PNODE ender; //尾结点
void add(PNODE node)//尾部追加(并非插入)
{
if (header == NULL)
{
header = node;
ender = node;
return;
}
ender->next = node;
ender = node;
}
PNODE create(int data) //创建结点
{
PNODE p = (PNODE)malloc(sizeof(NODE));//申请空间
p->data = data; //存数据
return p; //返回
}
int main() {
ender = header = NULL; //空链
add(create(1));
add(create(2));
add(create(3));
add(create(4));
{
PNODE p = header;
while (p != NULL)
{
printf("%d\n", p->data);
p = p->next; //将p的下一个结点赋值给p
}
}
return 0;
}
动态链表add
最新推荐文章于 2022-09-12 18:19:02 发布