C 双向链表实现（主要是重新练一下指针）

写了双向链表，因为增删改查都离不开链表的遍历，所以把遍历写成了一个可以添加函数指针的函数。虽然顺便回顾了一下函数指针，但实际代码量没有减少。

@author chihp

 下面是源代码：

DNode.h

#pragma once

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


typedef struct DNode{
    struct DNode *pre;
    struct DNode *next;
    int value;
} DNode;


DNode *NewNode(int value);
void ModNode(DNode *head, int src, int dst);
void _ModNode(DNode **curNode, DNode *tmpNode, int *value);
void _DelNode(DNode **curNode, DNode *tmpNode);
void DelNode(DNode **head, int value);
void _AddNodeToEnd(DNode **curNode, DNode *tmpNode);
void AddNode(DNode *Head, int value);
void ErgNodeEx(DNode **Head, DNode *tmpNode, void *OPNode);
void ErgNodeEx2(DNode *Head, DNode *tmpNode, void *OPNode, int param1);
DNode *FindNode(DNode *Head, int value);
void _PrintNode(DNode *curNode);
void PrintNode(DNode *Head);
void FreeNode(DNode **node);
void DelAllNode(DNode **head);
void _DelAllNode(DNode **curNode, DNode *tmpNode);

 

DNode.c：

// DNode.c : 双向链表
//

#include "DNode.h"

// 查找节点
DNode *FindNode(DNode *Head, int value)
{
    DNode *curNode;
    if (Head == NULL)
    {
        return NULL;
    }
    curNode = Head->next;
    while (curNode != NULL)
    {
        if (curNode->value == value)
        {
            return curNode;
        }
        curNode = curNode->next;
    }
    return NULL;
}
// ergodic遍历
void ErgNode(DNode *Head, void *OPNode)
{
    DNode *curNode;
    int (*func)(DNode *);
    func = OPNode;
    if (Head == NULL)
    {
        return;
    }
    curNode = Head;
    while (curNode != NULL)
    {
        (*func)(curNode);
        curNode = curNode->next;
    }
}
void PrintNode(DNode *Head)
{
    if (Head == NULL)
    {
        return;
    }
    ErgNode(Head, _PrintNode);
    printf("\n");
}

void _PrintNode(DNode *curNode)
{
    if (curNode == NULL)
    {
        return;
    }
    printf("%d ", curNode->value);
}

void ErgNodeEx(DNode **Head, DNode *tmpNode, void *OPNode)
{

    if ((*Head) == NULL)
    {
        return;
    }
    DNode *curNode;

    int (*func)(void **, void *);
    func = OPNode;

    curNode = (*Head);
    while (1)
    {
        (*func)(&curNode, tmpNode);
        if (curNode != NULL && curNode->pre == NULL)
        {
            (*Head) = curNode;
        }
        if ((*Head)->next == NULL && curNode == NULL)
        {
            (*Head) = curNode;
        }
        if (curNode == NULL)
        {
            break;
        }
        if (curNode != NULL)
        {
            curNode = curNode->next;
        }

    }
}

void ErgNodeEx2(DNode *Head, DNode *tmpNode, void *OPNode, int param1)
{
    if (tmpNode == NULL)
    {
        return;
    }
    if (Head == NULL)
    {
        return;
    }
    DNode *curNode;

    int (*func)(void **, void *, void *);
    func = OPNode;

    curNode = Head->next;
    while (curNode != NULL)
    {
        curNode = curNode->next;
        (*func)(&curNode, tmpNode, &param1);
    }
}
// 在结尾增加
void AddNode(DNode *Head, int value)
{
    DNode *nextNode = NewNode(value);
    ErgNodeEx(&Head, nextNode, _AddNodeToEnd);
}

void _AddNodeToEnd(DNode **curNode, DNode *tmpNode)
{
    if ((*curNode) == NULL)
    {
        return;
    }
    if ((*curNode)->next == NULL)
    {
        (*curNode)->next = tmpNode;
        tmpNode->pre = (*curNode);
        (*curNode) = (*curNode)->next;
    }
}
void DelNode(DNode **head, int value)
{
    DNode *tmpNode = NewNode(value);
    ErgNodeEx(head, tmpNode, _DelNode);
    FreeNode(&tmpNode);
}
void _DelNode(DNode **curNode, DNode *tmpNode)
{
    if ((*curNode) == NULL)
    {
        return;
    }
    if ((*curNode)->value == tmpNode->value)
    {
        DNode *pNode;
        if ((*curNode)->pre != NULL)
        {
            pNode = (*curNode)->pre;
            (*curNode)->pre->next = (*curNode)->next;
            (*curNode)->next->pre = (*curNode)->pre;
        }
        else
        {
            pNode = (*curNode)->next;
            if ((*curNode)->next != NULL)
            {
                (*curNode)->next->pre = NULL;

            }
        }

        FreeNode(&(*curNode));
        (*curNode) = pNode;
    }
}
void DelAllNode(DNode **head)
{
    ErgNodeEx(head, NULL, _DelAllNode);
    //DelNode(head, (*head)->value);
}
void _DelAllNode(DNode **curNode, DNode *tmpNode)
{
    if ((*curNode) == NULL)
    {
        return;
    }
    DNode *pNode;
    pNode = (*curNode)->next;
    (*curNode)->next->pre = NULL;
    FreeNode(&(*curNode));
    (*curNode) = pNode;
}

void ModNode(DNode *head, int src, int dst)
{
    DNode *tmpNode = NewNode(dst);
    ErgNodeEx2(head, tmpNode, _ModNode, src);
    FreeNode(&tmpNode);
}
void _ModNode(DNode **curNode, DNode *tmpNode, int *value)
{
    if ((*curNode) == NULL)
    {
        return;
    }
    if ((*curNode)->value == (*value))
    {
        (*curNode)->value = tmpNode->value;
    }
}
DNode *NewNode(int value)
{
    DNode *newNode;
    newNode = (DNode *)malloc(sizeof(DNode));
    if (newNode != NULL)
    {
        newNode->next = NULL;
        newNode->pre = NULL;
        newNode->value = value;
    }
    return newNode;
}

void FreeNode(DNode **node)
{
    if ((*node) != NULL)
    {
        free((*node));
        (*node) = NULL;
    }
    return;
}

调用：

#include <stdio.h>
#include <stdlib.h>
#include "DNode.h"

int main()
{
    DNode *head;
    head = NewNode(12);
    AddNode(head, 1);
    AddNode(head, 2);
    AddNode(head, 3);
    AddNode(head, 4);
    PrintNode(head);
    DelNode(&head, 12);
    PrintNode(head);
    ModNode(head, 4, 128);
    PrintNode(head);
    DNode *findtest;
    findtest = FindNode(head, 2);
    PrintNode(findtest);
    DelAllNode(&head);
    PrintNode(head);
    system("pause");
    return 0;
}