1.双向链表的按任意位置插入
//head.h
#ifndef __HEAD_H__
#define __HEAD_H__
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
enum {FALSE=-1,SUCCESS};
typedef char datatype;//类型重定义
//定义双向链表结构体
typedef struct Node
{
//数据域;存储数据元素
datatype data;
//指针域:下一个结点地址
struct Node *next;
//指针域:上一个结点地址
struct Node *prev;
}*DoubleLink;
DoubleLink create();
DoubleLink insert_head(DoubleLink head,datatype element);
void Output(DoubleLink head);
DoubleLink insert_tail(DoubleLink head,datatype element);
DoubleLink delete_head(DoubleLink head);
DoubleLink delete_tail(DoubleLink head);
DoubleLink Insert_pos(DoubleLink head,int pos,datatype element);
int Length(DoubleLink head);
DoubleLink Delete_pos(DoubleLink head,int pos);
#endif
//main.c
//双向链表任意位置插入
int pos;
printf("please enter insert position:");
scanf("%d",&pos);
printf("please enter insert element:");
scanf(" %c",&element);
head=Insert_pos(head,pos,element);
Output(head);
//调用输出函数
//双向链表遍历输出
void Output(DoubleLink head)
{
//链表为空
if(NULL==head)
{
puts("empty!");
return;
}
//循环输出
DoubleLink p=head;
while(p->next)
{
printf("%-4c ",p->data);
p=p->next;
}
printf("%-4c ",p->data);
printf("\n");
//逆向遍历输出
// while(p)
// {
// printf("%-4c ",p->data);
// p=p->prev;
// }
// printf("\n");
}
//test.c
//双向链表任意位置插入
DoubleLink Insert_pos(DoubleLink head,int pos,datatype element)
{
//判断位置是否合法
int len=Length(head);
if(pos<1||pos>len+1)
{
puts("ERROR!");
return head;
}
//创建新节点
DoubleLink s=create();
s->data=element;
//链表为空
if(NULL==head)
{
head=s;
return head;
}
//多节点
else
{
//插入首位
if(pos==1)
{
//调用头插函数
head=insert_head(head,element);
return head;
}
//插入末尾
else if(pos==len+1)
{
//调用尾插函数
head=insert_tail(head,element);
return head;
}
else
{
DoubleLink p=head;
for(int i=1;i<pos;i++)
{
p=p->next;
}
s->next=p;
s->prev=p->prev;
p->prev->next=s;
p->prev=s;
return head;
}
}
}
//调用函数
//创建新节点
DoubleLink create()
{
DoubleLink s=(DoubleLink)malloc(sizeof(struct Node));
if(s==NULL)
return NULL;
s->data=0;
s->next=NULL;
s->prev=NULL;
return s;
}
//双向链表求长度
int Length(DoubleLink head)
{
int i=0;
DoubleLink p=head;
while(p)
{
i++;
p=p->next;
}
return i;
}
//双向链表头插
DoubleLink insert_head(DoubleLink head,datatype element)
{
//创建新节点
DoubleLink s=create();
s->data=element;
//链表为空
if(NULL==head)
head=s;
else
{
s->next=head;
head->prev=s;
head=s;
}
return head;
}
//双向链表尾插
DoubleLink insert_tail(DoubleLink head,datatype element)
{
//创建新节点
DoubleLink s=create();
s->data=element;
//链表为空
if(NULL==head)
head=s;
else
{
DoubleLink p=head;
while(p->next!=NULL)
{
p=p->next;
}
p->next=s;
s->prev=p;
}
return head;
}
2.双向链表的按任意位置删除
//main.c
//双向链表任意位置删除
int pos;
printf("please enter delete position:");
scanf("%d",&pos);
head=Delete_pos(head,pos);
Output(head);
//test.c
//双向链表任意位置删除
DoubleLink Delete_pos(DoubleLink head,int pos)
{
//判断位置是否合法
int len=Length(head);
if(pos<1||pos>len)
{
puts("ERROR!");
return head;
}
//链表为空
if(NULL==head)
{
puts("empty!");
return head;
}
//多节点
else
{
//首位
if(pos==1)
{
//调用头删
head=delete_head(head);
return head;
}
//末位
else if(pos==len)
{
//调用尾删函数
head=delete_tail(head);
return head;
}
//其他位置
else
{
DoubleLink del=head;
for(int i=1;i<pos;i++)
{
del=del->next;
}
//删除
del->next->prev=del->prev;
del->prev->next=del->next;
free(del);
del=NULL;
return head;
}
}
}
//调用函数
//双向链表头删
DoubleLink delete_head(DoubleLink head)
{
//链表为空
if(NULL==head)
{
puts("empty!");
return head;
}
//多个节点
DoubleLink del=head;
head=head->next;
head->prev=NULL;
free(del);
del=NULL;
return head;
}
//双向链表尾删
DoubleLink delete_tail(DoubleLink head)
{
//链表为空
if(NULL==head)
{
puts("empty!");
return head;
}
//一个节点
else if(head->next==NULL)
{
free(head);
head=NULL;
return head;
}
//多个节点
DoubleLink del=head;
while(del->next)
{
del=del->next;
}
DoubleLink p=del->prev;
p->next=NULL;
free(del);
del=NULL;
return head;
}