一、作业
(1) 完成双向循环链表基操:
![](https://i-blog.csdnimg.cn/direct/cb8c9aad3f96410a99abfcdd9d391bea.png)
(插入的数据为整型int)
实现(创建、判空、尾插、遍历、尾删、销毁)
1.doublelplink.c
#include "doublelplink.h"
//创建
doublelplinkptr create()
{
doublelplinkptr H = (doublelplinkptr)malloc(sizeof(doublelplink));
if(NULL == H)
{
printf("创建失败!\n");
return NULL;
}
H->len = 0;
H->next = H;
H->next->prior = H;
printf("创建成功!\n");
return H;
}
//判空
int empty(doublelplinkptr H)
{
if(NULL == H)
{
printf("判空失败!\n");
return -1;
}
return H->next->prior == H;
}
//尾插
int tail_add(doublelplinkptr H,DataType e)
{
if(NULL == H )
{
printf("插入失败!\n");
return 0;
}
//申请节点,封装数据
doublelplinkptr p =(doublelplinkptr)malloc(sizeof(doublelplink));
if(NULL == p)
{
printf("申请节点失败!\n");
return 0;
}
p->data = e;
p->next = NULL;
p->prior = NULL;
//定义一个指针指向最后一个节点
doublelplinkptr q = H;
for(int i=0; i<H->len; i++)
{
q = q->next;
}
//尾插
q->next = p;
p->next=H;
H->prior=p;
//插入成功,双向链表自增
H->len++;
return 1;
}
//遍历
void show(doublelplinkptr H)
{
if(NULL == H)
{
printf("遍历失败!\n");
return;
}
//定义一个指针指向节点
doublelplinkptr p = H;
while(p->next != H)
{
p=p->next;
printf("%d ",p->data);
}
printf("\n");
}
//尾删
int tail_del(doublelplinkptr H)
{
if(NULL == H || empty(H))
{
printf("删除失败!\n");
return 0;
}
//定义一个指针指向节点
doublelplinkptr p = H;
for(int i=0; i<H->len-1 ;i++)
{
p=p->next;
}
//尾删
free(p->next);
p->next=H;
H->prior=p;
//删除成功,双向链表自减
H->len--;
return 1;
}
//销毁
void my_free(doublelplinkptr H)
{
if(NULL == H)
{
printf("销毁失败!\n");
return ;
}
while(H->next != H)
{
tail_del(H);
}
free(H);
H=NULL;
printf("销毁成功!\n");
}
2.doublelplink.h
#ifndef __DOUBLELPLINK_H__
#define __DOUBLELPLINK_H__
#include <stdio.h>
#include <stdlib.h>
typedef int DataType;
typedef struct node
{
union
{
int len;//头结点数据域
DataType data;//普通节点数据域
};
struct node *next;
struct node *prior;
}doublelplink,*doublelplinkptr;
//创建
doublelplinkptr create();
//判空
int empty(doublelplinkptr H);
//尾插
int tail_add(doublelplinkptr H,DataType e);
//遍历
void show(doublelplinkptr H);
//尾删
int tail_del(doublelplinkptr H);
//销毁
void my_free(doublelplinkptr H);
#endif
3.main.c
#include "doublelplink.h"
int main(int argc, const char *argv[])
{
doublelplinkptr H = create();
tail_add(H,10);
tail_add(H,20);
tail_add(H,30);
tail_add(H,40);
tail_add(H,50);
tail_add(H,60);
show(H);
tail_del(H);
tail_del(H);
show(H);
my_free(H);
return 0;
}
4.结果
创建成功!
10 20 30 40 50 60
10 20 30 40
销毁成功!
二、思维导图
![](https://i-blog.csdnimg.cn/direct/b31d829a4fd6409085b6c3b6ac555295.png)