[C++学习]C++链表使用完整代码，主要是想学它用来阅读Mysql的多个连接句柄。

jackxiang 2011-8-5 18:17

大 | 中 | 小

WEB2.0 评论(0)

g++ lianbiao.cpp

/*
   练习使用链表：创建链表、遍历链表、查找节点、添加节点、删除节点
 */

#include "stdio.h"
#include "string.h"
#include "assert.h"
#include "stdlib.h"
//#include "windows.h"

#define COUNT 3

//定义一个节点结构体
struct NODE
{
    unsigned long uID;
    char strName[16];  //用指针的话会出访问冲突异常
    NODE *next;
};

//创建一个具有n个节点的链表，从键盘输入数据将其初始化，并返回链表的首节点指针
NODE *createNode(int n)
{
    NODE *pHead, //首节点指针
         *pRear, //尾节点指针
         *pNew; //新节点指针
    int i;
    char *strName = new char[16];
    for (i=0; i<n; i++)
    {
        pNew = new NODE;
        do
        {
            printf("请输入ID和名称：\n ");
            scanf("%d %s",&pNew->uID, strName);
            if (strlen(strName) > 16)
            {
                printf("输入名称长度超出范围，请重新输入：\n ");
                //sleep(1000);
            }
        } while(strlen(strName) > 16);
        strcpy(pNew->strName, strName);

if (0==i)
        {
            pRear = pHead = pNew;
        }
        else
        {
            pRear->next = pNew;
        }
        pNew->next = NULL;
        pRear = pNew;
    }
    delete []strName;
    return pHead;
}

//打印链表中所有节点的数据
void printNode(NODE *pHead)
{
    NODE *pTemp = pHead;
    assert(pTemp != NULL);
    while (pTemp != NULL)
    {
        printf("%d %s ",pTemp->uID, pTemp->strName);
        pTemp = pTemp->next;
    }
}

//查询链表中具有指定ID的节点，并返回此节点指针
NODE *searchNode(NODE *pHead, unsigned long uID)
{
    NODE *pDest = pHead;
    assert(pDest != NULL);
    while (pDest->next!=NULL && pDest->uID!=uID)
    {
        pDest = pDest->next;
    }
    if (pDest->uID == uID)
    {
        return pDest;
    }
    else
    {
        printf("搜索失败，未找到找定ID的节点！ ");
        return NULL;
    }
}

//删除指定ID的节点
NODE *deleteNode(NODE *pHead, unsigned long uID)
{
    NODE *pDest, //要删除的节点
         *pBefore; //前一个节点
    pDest = pHead;
    assert(pDest != NULL);
    while (pDest->next!=NULL && pDest->uID!=uID)
    {
        pBefore = pDest;
        pDest = pDest->next;
    }
    if (pDest->uID == uID)
    {
        if (pDest == pHead)
        {
            pHead = pDest->next;
        }
        else
        {
            pBefore->next = pDest->next;
        }
        free(pDest);
        printf("节点已被删除！ ");
    }
    else
    {
        printf("未找到指定节点，无法将其删除！ ");
    }
    return pHead;
}

//在指定ID的节点后插入一个新的节点
NODE *insertNode(NODE *pHead, unsigned long uID)
{
    NODE *pDest, *pNew;
    pDest = pHead;
    assert(pDest != NULL);
    while(pDest->next!=NULL && pDest->uID!=uID)
    {
        pDest = pDest->next;
    }
    if(pDest->uID == uID)
    {
        pNew = new NODE;
        printf("请输入新节点的ID和名称：\n ");
        scanf("%d %s",&pNew->uID,pNew->strName);
        pNew->next = pDest->next;
        pDest->next = pNew;
        printf("节点插入完成！ ");
    }
    else
    {
        printf("未找到指定节点！ ");
    }
    return pHead;
}

int main()
{
    NODE *pHead, *pDest;
    int nSelect;
    bool isExit = false;
    unsigned long uID;
    printf("请根据提示输入数据初始化链表：\n ");
    pHead = createNode(COUNT);
    assert(pHead != NULL);
    printf("链表创建成功！存储数据如下：\n ");
    printNode(pHead);
    while (!isExit)
    {
        printf("\n --------------------------\n ");
        printf("请选择要进行的操作：\n ");
        printf("1.打印出链表所有节点数据：\n ");
        printf("2.输入ID查询名称。\n ");
        printf("3.删除指定ID的节点。\n ");
        printf("4.在指定ID的节点后插入一个新的节点。\n ");
        printf("5.退出。\n ");
        printf("\n ---------------------------\n ");
        scanf("%d",&nSelect);
        switch(nSelect)
        {
            case 1:
                printf("链表所有节点数据如下：\n ");
                printNode(pHead);
                break;
            case 2:
                printf("请输入要查询的节点的ID：\n ");
                scanf("%d",&uID);
                pDest = searchNode(pHead, uID);
                if (pDest != NULL)
                {
                    printf("已找到节点，名字为：%s ",pDest->strName);
                }
                break;
            case 3:
                printf("请输入要删除的节点的ID：\n ");
                scanf("%d",&uID);
                pHead = deleteNode(pHead, uID);
                break;
            case 4:
                printf("请输入要删除的节点的ID：\n ");
                scanf("%d",&uID);
                pHead = insertNode(pHead, uID);
                break;
            case 5:
                isExit = true;
                printf("程序已退出！ ");
                break;
            default:
                printf("按键错误，请重新选择！ ");
                break;
        }
    }
    return 1;
}

书上来的代码：

上面代码图示：