双向链表

双向链表

头文件DList.h：

#ifndef __DLIST_H__
#define __DLIST_H__

#include <stdio.h>
#include <assert.h>
#include <stdlib.h>

typedef int DataType;

typedef struct DList
{
    DataType data;
    struct DList *pPrev;
    struct DList *pNext;
}DList;

//开辟新空间
DList *BuyNewNode(DataType data);

//初始化
void Init(DList **ppHead);

//清空
void Clear(DList *pHead);

//销毁
void Destory(DList **ppHead);

//尾插
void PushBack(DList *pHead,DataType data);

//头插
void PushFront(DList *pHead,DataType data);

//打印
void Print(DList *pHead);

//插入
void Insert(DList *pHead,DList *pPos,DataType data);

//删除
void Erase(DList *pHead, DList *pPos);

//尾删
void PopBack(DList *pHead);

//头删
void PopFront(DList *pHead);

//查找
DList *Find(DList *pHead,DataType data);

#endif //__DLIST_H__

主函数：

#include "DList.h"

int main()
{
    DList *pHead;
    Init(&pHead);

    PushBack(pHead,2);
    PushFront(pHead,1);
    Insert(pHead,pHead,2);
    Insert(pHead,pHead->pNext,1);

    Print(pHead);

    Erase(pHead,Find(pHead,1));
    Print(pHead);


    Destory(&pHead);
}

函数实现DList.c：

#include "DList.h"

//开辟新空间
DList *BuyNewNode(DataType data)
{
    DList *pNewNode = (DList *)malloc(sizeof(DList));
    assert(pNewNode);
    pNewNode->data = data;
    pNewNode->pPrev = NULL;
    pNewNode->pNext = NULL;

    return pNewNode;
};

//初始化
void Init(DList **ppHead)
{
    int no_use = 0;
    *ppHead = (DList *)BuyNewNode(no_use);
    (*ppHead)->pPrev = *ppHead;
    (*ppHead)->pNext = *ppHead;
}

//清空链表，头还在
void Clear(DList *pHead)
{
    DList *pNode = NULL;
    DList *pNext = NULL;
    for(pNode=pHead->pNext; pNode!=pHead; pNode=pNext)
    {
        pNext = pNode->pNext;
        free(pNode);
    }

    pHead->pPrev = pHead;
    pHead->pNext = pHead;
}

//销毁链表，头不在
void Destory(DList **ppHead)
{
    Clear(*ppHead);
    free(*ppHead);
    *ppHead = NULL;
}

//尾插
void PushBack(DList *pHead,DataType data)
{
    DList *pNewNode = BuyNewNode(data);
    DList *pLast = pHead->pPrev;

    pLast->pNext = pNewNode;

    pNewNode->pPrev = pLast;
    pNewNode->pNext = pHead;

    pHead->pPrev = pNewNode;

    //Insert(pHead,pHead,data);  //用位置插实现尾插
}

//头插
void PushFront(DList *pHead,DataType data)
{
    DList *pNewNode = BuyNewNode(data);
    DList *pFirst = pHead->pNext;

    pHead->pNext = pNewNode;
    pNewNode->pPrev = pHead;

    pNewNode->pNext = pFirst;
    pFirst->pPrev = pNewNode;

    //Insert(pHead,pHead->pNext,data);  //用位置插实现头插
}

//插入
void Insert(DList *pHead,DList *pPos,DataType data)
{
    DList *pNewNode = BuyNewNode(data);
    DList *pPrev = pPos->pPrev;

    pPrev->pNext = pNewNode;
    pNewNode->pPrev = pPrev;

    pNewNode->pNext = pPos;
    pPos->pPrev = pNewNode;
}

//打印
void Print(DList *pHead)
{
    DList *pNode = pHead;
    for(pNode=pHead->pNext; pNode!=pHead;pNode=pNode->pNext)
    {
        printf("%d -> ",pNode->data);
    }
    printf("\n");
}


//删除
void Erase(DList *pHead, DList *pPos)
{
    DList *pLast = pPos->pPrev;
    DList *pNext = pPos->pNext;

    pLast->pNext = pNext;
    pNext->pPrev = pLast;

    free(pPos);
}

//尾删
void PopBack(DList *pHead)
{
    Erase(pHead,pHead->pPrev);
}

//头删
void PopFront(DList *pHead)
{
    Erase(pHead,pHead->pNext);
}

//查找
DList *Find(DList *pHead,DataType data)
{
    DList *pNode = pHead;
    for(pNode=pHead->pNext; pNode!=pHead; pNode=pNode->pNext)
    {
        if(pNode->data == data)
            return pNode;
    }
    return NULL;
}

执行结果：