双链表
用C语言实现双向循环链表,并完成头插、尾插、头删、尾删、查找、打印、排序、逆序、按值插入等……
testMain.c
/*双链表*/
#include"list.h"
int main()
{
DCList mylist;
DCListInit(&mylist);
DCListNode *p;
ElemType item, key;
int select = 1;
int pos = 0;
while (select)
{
printf("*********************************************\n");
printf("* [1]push_back [2]push_front *\n");
printf("* [3]show_list [4]pop_back *\n");
printf("* [5]pop_front [6]insert_value *\n");
printf("* [7]delete_value [8]find_value *\n");
printf("* [9]length [10]sort *\n");
printf("* [11]reverse [12]clear *\n");
printf("* [0]quit_system *\n");
printf("*********************************************\n");
printf("请选择:>");
scanf("%d", &select);
if (select == 0)
break;
switch (select)
{
case 1:
printf("请输入要插入的值[以-1结束]:>");
while (scanf("%d", &item), item != -1)
{
DCListPushBack(&mylist, item);
}
printf("尾部插入数据成功...\n");
break;
case 2:
printf("请输入要插入的值[以-1结束]:>");
while (scanf("%d", &item), item != -1)
{
DCListPushFront(&mylist, item);
}
printf("头部插入数据成功...\n");
break;
case 3:
DCListShow(&mylist);
break;
case 4:
DCListPopBack(&mylist);
printf("尾部删除数据成功...\n");
break;
case 5:
DCListPopFront(&mylist);
break;
case 6:
DCListSort(&mylist);
printf("请输入要插入的数据:>");
scanf("%d", &item);
DCListInsertByVal(&mylist, item);
break;
case 7:
printf("请输入要删除的值:>");
scanf("%d", &key);
DCListDeleteByVal(&mylist, key);
printf("删除成功...\n");
break;
case 8:
printf("请输入要查找的值:>");
scanf("%d", &key);
p = DCListFind(&mylist, key);
if (p == NULL)
printf("要查找的值不存在.\n");
else
printf("要查找的值为:> %p\n", &(p->data));
break;
case 9:
printf("seqlist len = %d\n", DCListLength(&mylist));
break;
case 10:
DCListSort(&mylist);
printf("顺序表排序成功......\n");
break;
case 11:
DCListReverse(&mylist);
break;
case 12:
DCListClear(&mylist);
printf("清除数据表成功......\n");
break;
}
}
DCListDestroy(&mylist);
printf("GoodBye......\n");
return 0;
}
common.h
#ifndef _COMMON_H_
#define _COMMOM_H_
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>
#include <memory.h>
#define ElemType int
void Swap(ElemType *a, ElemType *b)
{
ElemType temp = *a;
*a = *b;
*b = temp;
}
#endif /*_COMMOM_H_*/
list.h
#ifndef _LIST_H_
#define _LIST_H_
#include"common.h"
///
//带头的双循环链表
typedef struct DCListNode
{
ElemType data;
struct DCListNode *next;
struct DCListNode *prev;
}DCListNode;
typedef struct DCList
{
DCListNode *head;
}DCList;
///
//双链表的函数接口声明
static DCListNode* _Buydnode(ElemType x);
void DCListInit(DCList *plist);
void DCListPushBack(DCList *plist, ElemType x);
void DCListPushFront(DCList *plist, ElemType x);
void DCListShow(DCList *plist);
void DCListPopBack(DCList *plist);
void DCListPopFront(DCList *plist);
DCListNode* DCListFind(DCList *plist, ElemType key);
size_t DCListLength(DCList *plist);
void DCListClear(DCList *plist);
void DCListDestroy(DCList *plist);
void DCListDeleteByVal(DCList *plist, ElemType key);
void DCListInsertByVal(DCList *plist, ElemType x);
void DCListReverse(DCList *plist);
void DCListSort(DCList *plist);
///
//双链表的函数接实现
//购买节点
static DCListNode* _Buydnode(ElemType x)
{
DCListNode *s = (DCListNode*)malloc(sizeof(DCListNode));
assert(s != NULL);
s->data = x;
s->next = s->prev = s;
return s;
}
//初始化
void DCListInit(DCList *plist)
{
plist->head = _Buydnode(0);
}
//尾插
void DCListPushBack(DCList *plist, ElemType x)
{
assert(plist != NULL);
DCListNode *s = _Buydnode(x);
s->prev = plist->head->prev;
s->prev->next = s;
s->next = plist->head;
plist->head->prev = s;
}
//头插
void DCListPushFront(DCList *plist, ElemType x)
{
assert(plist != NULL);
DCListNode *s = _Buydnode(x);
s->next = plist->head->next;
s->prev = plist->head;
s->next->prev = s;
plist->head->next = s;
}
//打印链表
void DCListShow(DCList *plist)
{
assert(plist != NULL);
DCListNode *p = plist->head->next;
while (p != plist->head)
{
printf("%d->", p->data);
p = p->next;
}
printf("Over.\n");
}
//尾删
void DCListPopBack(DCList *plist)
{
assert(plist != NULL);
DCListNode *p = plist->head->prev;
if (p == plist->head)
return;
plist->head->prev = p->prev;
p->prev->next = plist->head;
free(p);
}
//头删
void DCListPopFront(DCList *plist)
{
assert(plist != NULL);
DCListNode *p = plist->head->next;
if (p == plist->head)
return;
plist->head->next = p->next;
p->next->prev = plist->head;
free(p);
}
//按值查找,返回地址
DCListNode* DCListFind(DCList *plist, ElemType key)
{
assert(plist != NULL);
DCListNode *p = plist->head->next;
while (p != plist->head && p->data != key)
p = p->next;
if (p != plist->head)
return p;
return NULL;
}
size_t DCListLength(DCList *plist)
{
assert(plist != NULL);
size_t len = 0;
DCListNode *p = plist->head->next;
while (p != plist->head)
{
len++;
p = p->next;
}
return len;
}
//清空链表
void DCListClear(DCList *plist)
{
assert(plist != NULL);
DCListNode *p = plist->head->next;
while (p != plist->head)
{
p->next->prev = p->prev;
p->prev->next = p->next;
free(p);
p = plist->head->next;
}
}
void DCListDestroy(DCList *plist)
{
DCListClear(plist);
free(plist->head); //释放头结点
plist->head = NULL;
}
//按值删除
void DCListDeleteByVal(DCList *plist, ElemType key)
{
assert(plist != NULL);
DCListNode *p = DCListFind(plist, key);
if (p == NULL)
return;
p->next->prev = p->prev;
p->prev->next = p->next;
free(p);
}
//按值插入
void DCListInsertByVal(DCList *plist, ElemType x)
{
assert(plist != NULL);
DCListNode *p = plist->head->next;
while (p != plist->head && p->data<x)
p = p->next;
DCListNode *s = _Buydnode(x);
s->next = p;
s->prev = p->prev;
p->prev->next = s;
p->prev = s;
}
//逆序
void DCListReverse(DCList *plist)
{
assert(plist != NULL);
DCListNode *p = plist->head->next;
DCListNode *q = p->next;
//断开链表
p->next = plist->head;
plist->head->prev = p;
while (q != plist->head)
{
p = q;
q = q->next;
p->next = plist->head->next;
p->prev = plist->head;
p->next->prev = p;
p->prev->next = p; // plist->head->next = p;
}
}
//排序
void DCListSort(DCList *plist)
{
assert(plist != NULL);
DCListNode *p = plist->head->next;
DCListNode *q = p->next;
p->next = plist->head;
plist->head->prev = p;
while (q != plist->head)
{
p = q;
q = q->next;
//寻找p的插入位置
DCListNode *t = plist->head->next;
while (t != plist->head && t->data<p->data)
t = t->next;
p->next = t;
p->prev = t->prev;
p->next->prev = p;
p->prev->next = p;
p = q;
}
}