链表的实现

来源：互联网发布：pdf转word 软件编辑：程序博客网时间：2024/05/18 00:03

《剑指offer》这本书里的实现方法，条理清晰，使用起来也很方便，所以直接拿来用了。

//list.h// 《剑指Offer——名企面试官精讲典型编程题》代码// 著作权所有者：何海涛struct ListNode{    int       m_nValue;    ListNode* m_pNext;};__declspec( dllexport ) ListNode* CreateListNode(int value);__declspec( dllexport ) void ConnectListNodes(ListNode* pCurrent, ListNode* pNext);__declspec( dllexport ) void PrintListNode(ListNode* pNode);__declspec( dllexport ) void PrintList(ListNode* pHead);__declspec( dllexport ) void DestroyList(ListNode* pHead);__declspec( dllexport ) void AddToTail(ListNode** pHead, int value);__declspec( dllexport ) void RemoveNode(ListNode** pHead, int value);

//list.cpp// 《剑指Offer——名企面试官精讲典型编程题》代码// 著作权所有者：何海涛#include "stdafx.h"#include "list.h"#include <stdio.h>#include <stdlib.h>ListNode* CreateListNode(int value){    ListNode* pNode = new ListNode();    pNode->m_nValue = value;    pNode->m_pNext = NULL;    return pNode;}void ConnectListNodes(ListNode* pCurrent, ListNode* pNext){    if(pCurrent == NULL)    {        printf("Error to connect two nodes.\n");        exit(1);    }    pCurrent->m_pNext = pNext;}void PrintListNode(ListNode* pNode){     if(pNode == NULL)    {        printf("The node is NULL\n");    }    else    {        printf("The key in node is %d.\n", pNode->m_nValue);    }}void PrintList(ListNode* pHead){    printf("PrintList starts.\n");        ListNode* pNode = pHead;    while(pNode != NULL)    {        printf("%d\t", pNode->m_nValue);        pNode = pNode->m_pNext;    }    printf("\nPrintList ends.\n");}void DestroyList(ListNode* pHead){    ListNode* pNode = pHead;    while(pNode != NULL)    {        pHead = pHead->m_pNext;        delete pNode;        pNode = pHead;    }}void AddToTail(ListNode** pHead, int value){    ListNode* pNew = new ListNode();    pNew->m_nValue = value;    pNew->m_pNext = NULL;    if(*pHead == NULL)    {        *pHead = pNew;    }    else    {        ListNode* pNode = *pHead;        while(pNode->m_pNext != NULL)            pNode = pNode->m_pNext;        pNode->m_pNext = pNew;    }}void RemoveNode(ListNode** pHead, int value){    if(pHead == NULL || *pHead == NULL)        return;    ListNode* pToBeDeleted = NULL;    if((*pHead)->m_nValue == value)    {        pToBeDeleted = *pHead;        *pHead = (*pHead)->m_pNext;    }    else    {        ListNode* pNode = *pHead;        while(pNode->m_pNext != NULL && pNode->m_pNext->m_nValue != value)            pNode = pNode->m_pNext;        if(pNode->m_pNext != NULL && pNode->m_pNext->m_nValue == value)        {            pToBeDeleted = pNode->m_pNext;            pNode->m_pNext = pNode->m_pNext->m_pNext;        }    }    if(pToBeDeleted != NULL)    {        delete pToBeDeleted;        pToBeDeleted = NULL;    }}

0 0