头文件:
#ifndef __HEAD_H__
#define __HEAD_H__
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef char datatype;
//定义双向链表结构
typedef struct Node
{
//数据域:存储数据元素
datatype data;
//指针域:下一个节点地址
struct Node *next;
//指针域:上一个节点地址
struct Node *prev;
}*Doublelink;
Doublelink crete();
Doublelink insert_head(Doublelink head,datatype element);
void output(Doublelink head);
Doublelink insert_rear(Doublelink head,datatype element);
Doublelink del_head(Doublelink head);
Doublelink del_rear(Doublelink head);
Doublelink insert_pos(Doublelink head,int pos,datatype element);
int lenth(Doublelink head);
Doublelink del_pos(Doublelink head,int pos);
#endif
主函数:
int main(int argc, const char *argv[])
{
Doublelink head=NULL;
int n;
datatype element;
printf("please neter n:");
scanf("%d",&n);
for(int i=0;i<n;i++)
{
printf("please enter %d element:",i+1);
scanf(" %c",&element);
//head=insert_head(head,element);
head=insert_rear(head,element);
}
output(head);
//头删
//head=del_head(head);
//output(head);
//尾删
//head=del_rear(head);
//output(head);
//按任意位置插入
/*
int pos;
printf("please enter pos:");
scanf("%d",&pos);
printf("please enter element:");
scanf(" %c",&element);
head=insert_pos(head,pos,element);
output(head);
*/
//按任意位置删除
int pos;
printf("please enter pos:");
scanf("%d",&pos);
head=del_pos(head,pos);
output(head);
return 0;
}
自定义函数:
#include"head.h"
/*
* function: 创建
* @param [ in]
* @param [out]
* @return
*/
Doublelink crete()
{
Doublelink s=(Doublelink)malloc(sizeof(struct Node));
if(s==NULL)
return NULL;
s->data=0;
s->next=s->prev=NULL;
return s;
}
/*
* function: 头插
* @param [ in]
* @param [out]
* @return
*/
Doublelink insert_head(Doublelink head,datatype element)
{
Doublelink s=crete();
s->data=element;
if(NULL==head)
head=s;
else
{
s->next=head;
head->prev=s;
head=s;
}
return head;
}
/*
* function: 输出函数
* @param [ in]
* @param [out] 头
* @return 无
*/
void output(Doublelink head)
{
if(head==NULL)
return;
Doublelink p=head;
while(p->next!=NULL)
{
printf(" %c",p->data);
p=p->next;
}
printf(" %c\n",p->data);
while(p!=NULL)
{
printf(" %c",p->data);
p=p->prev;
}
putchar(10);
}
/*
* function: 尾插
* @param [ in] head,element
* @param [out]
* @return head
*/
Doublelink insert_rear(Doublelink head,datatype element)
{
Doublelink s=crete();
s->data=element;
if(NULL==head)
head=s;
else
{
Doublelink p=head;
while(p->next)
{
p=p->next;
}
p->next=s;
s->prev=p;
}
return head;
}
/*
* function: 头删
* @param [ in]
* @param [out]
* @return
*/
Doublelink del_head(Doublelink head)
{
if(head==NULL)
return NULL;
Doublelink p=head;
head=head->next;
free(p);
p=NULL;
head->prev=NULL;
return head;
}
/*
* function: 尾删
* @param [ in]
* @param [out]
* @return
*/
Doublelink del_rear(Doublelink head)
{
if(head==NULL)
{
return head;
}
else if(head->next==NULL)
{
free(head);
head=NULL;
return head;
}
else
{
Doublelink p=head;
while(p->next)
p=p->next;
p->prev->next=NULL;
free(p);
p=NULL;
}
return head;
}
/*
* function: 长度测量
* @param [ in]
* @param [out]
* @return
*/
int lenth(Doublelink head)
{
Doublelink p=head;
int counter=0;
while(p)
{
counter++;
p=p->next;
}
return counter;
}
/*
* function: 任意位置插入
* @param [ in]
* @param [out]
* @return
*/
Doublelink insert_pos(Doublelink head,int pos,datatype element)
{
Doublelink p=head;
Doublelink s=crete();
s->data=element;
if(NULL==head)
{
if(pos==1)
{
head=insert_head(head,element);
return head;
}
else
return head;
}
if(pos<1 || pos>lenth(head)+1)
{
puts("ERROR");
return head;
}
if(pos==1)
{
head=insert_head(head,element);
return head;
}
else
{
for(int i=1;i<pos-1;i++)
{
p=p->next;
}
s->next=p->next;
s->prev=p;
p->next->prev=s;
p->next=s;
return head;
}
}
Doublelink del_pos(Doublelink head,int pos)
{
Doublelink p=head;
if(NULL==head)
return head;
if(pos<1 || pos>lenth(head))
{
puts("ERROR");
return head;
}
else
{
if(pos==1)
{
head=del_head(head);
return head;
}
else if(pos==lenth(head))
{
head=del_rear(head);
return head;
}
else
{
for(int i=1;i<pos;i++)
{
p=p->next;
}
//p->prev->next=p->next;
//p->next->prev=p->prev;
p->next->prev=p->prev;
p->prev->next=p->next;
free(p);
p=NULL;
return head;
}
}
}