双向循环链表的学习总结
双向循环链表的概念和作用
双向循环链表有两个指针节点,一个指向前驱,一个指向后继,可以向前和向后访问任何数据。
##实现创建、删除、添加、输出双向循环链表的数据的C语言代码
/* 双向链表的创建及插入一个数据及输出所有的数据 */
#include<stdio.h>
#include<stdlib.h>
struct node_t
{
int num;
struct node_t *pre;
struct node_t *next;
}node;
int main(int argv, char *argn[])
{
int num = 0;
int i = 0;
struct node_t *p, *p1, *p2, *p3, *p4, *p5,*p6, *head;
head = (struct node_t*)malloc(sizeof(struct node_t));
head->pre = NULL;
head->next = NULL;
p1 = head;
p2 = head;
scanf("%d", &num);
while (num != -1)//当输入的值不是-1时,则继续创建循环链表
{
p = (struct node_t*)malloc(sizeof(struct node_t));
p1->num = num;
p->pre = p1;
p1->next = p;
p1 = p1->next;
p->next = NULL;
scanf("%d", &num);
}
/* 依次输出双向链表的值 */
while (p2->next != NULL)
{
printf("%d ", p2->num);
p2 = p2->next;
}
/* 在第i个位置插入数值 */
p1 = head;
p5 = NULL;
scanf("%d%d", &i, &num);
p4 = (struct node_t*)malloc(sizeof(struct node_t));
p4->num = num;
while (--i)
{
p5 = p1->next->next;
p1 = p1->next;
}
p4->next = p5;
p5->pre = p4;
p1->next = p4;
p4->pre = p1;
p2 = head;
/* 依次输出双向链表的值 */
while (p2->next != NULL)
{
printf("%d ", p2->num);
p2 = p2->next;
}
/* 删除第 i 个数数据的值 */
scanf("%d%d", &i, &num);
p1 = head;
while (--i)
{
p2 = p1->next->next;
p1 = p1->next; //这个是p2
}
p1 = p1->pre;//这个是p1原来的位置
p1->next = p2;
p2->pre = p1;
p2 = head;
/* 依次输出双向链表的值 */
while (p2->next != NULL)
{
printf("%d ", p2->num);
p2 = p2->next;
}
system("pause");
}