c++里的链表

最新推荐文章于 2024-07-12 23:24:36 发布
最新推荐文章于 2024-07-12 23:24:36 发布
阅读量657 收藏
点赞数
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_41490433/article/details/84345820
版权

#include "stdafx.h"

#include<Windows.h>

#include<iostream>

using namespace std;

struct  sStudent

{

        sStudent()

        {

               iId = 0;

               //memset(szName, 0, sizeof(szName));

               iGrade = 0;

               pNext = nullptr;

        }

        int iId;

        //char szName[32];

        int iGrade;

        sStudent* pNext;

};

//创建链表

void CreateList(sStudent* pHeadNode,int iSize);

//遍历链表

void ViewList(sStudent* pHead);

//查找链表

sStudent* FindList(sStudent* pHead, int iIndex);

//删除链表

void DeleteList(sStudent*& pHead, int iIndex);

//插入链表

void InsertList(sStudent*& pHead, int iIndex);

//链表翻转

void ReversalList(sStudent*& pHead);

void ReversalList2(sStudent*& pHead);

sStudent* pHeadNode = new sStudent;//头结点

int main()

{

        pHeadNode->iId = 1;

        pHeadNode->iGrade = 1;

        int iLen = 0;

        int iFindLen = 0;

        int iDeleteLen = 0;

        int iInsertLen = 0;

        cout << "输入创建链表的长度：" << endl;

        cin >> iLen;

        CreateList(pHeadNode,iLen);

        /*cout << "输入查找链表的id：";

        cin >> iFindLen;

        sStudent* pFindNode= FindList(pHeadNode, iFindLen);

        if (nullptr != pFindNode)

        {

               cout << pFindNode->iId << "\t" << pFindNode->iGrade << endl;

        }

        else

        {

               cout << "找不到信息" << endl;

        }*/

        //cout << "所有链表的信息：" << endl;

        //ViewList(pHeadNode);

        //cout << "输入要删除的节点序号";

        //cin >> iDeleteLen;

        //DeleteList(pHeadNode, iDeleteLen);

        //cout << "所有链表的信息：" << endl;

        //ViewList(pHeadNode);

        /*cout << "输入要插入节点的位置";

        cin >> iInsertLen;

        InsertList(pHeadNode, iInsertLen);

        ViewList(pHeadNode);*/

        ReversalList2(pHeadNode);

        cout << "翻转后的所有链表的信息：" << endl;

        ViewList(pHeadNode);

        system("pause");

    return 0;

}

void CreateList(sStudent* pHeadNode, int iSize)

{       

        sStudent* pNextNode = pHeadNode;//下一节点

        int i = 1;

        int iCount = 1;

        while (i<iSize)

        {

               sStudent* pNewNode = new sStudent;

               cout << "输入第" << iCount << "节点的id" << endl;

               cin >> pNewNode->iId;

               cout << "输入第" << iCount << "节点的成绩" << endl;

               cin >> pNewNode->iGrade;

               pNextNode->pNext = pNewNode;

               pNextNode = pNewNode;

               i++;

               iCount++;

        }

}

void ViewList(sStudent* pHead)

{

        //当前节点，默认为头结点

        sStudent* pCurNode = pHead;

        int iCount=0;

        while (nullptr != pCurNode)

        {

               cout << "第" << iCount << "个节点"<<endl;

               cout << pCurNode->iId << "\t" << pCurNode->iGrade << endl;

               pCurNode = pCurNode->pNext;

               iCount++;

        }

}

sStudent* FindList(sStudent * pHead, int iIndex)

{

        sStudent* pCurNode =pHead;

        int iCount = 0;

        while (nullptr!=pCurNode)

        {

               if (iIndex == iCount)

               {

                       return pCurNode;

               }

               pCurNode = pCurNode->pNext;

               iCount++;

        }

        return nullptr;

}

void DeleteList(sStudent *& pHead, int iIndex)

{

        if (0 == iIndex)

        {

               pHead = pHead->pNext;

               delete pHead;

               pHead = nullptr;

               return;

        }

        else

        {

               //要删除的节点

               sStudent* pCurNode = FindList(pHead, iIndex);

               //要删除的上一个节点

               sStudent* pCurLastNode = FindList(pHead, iIndex - 1);

               //将要删除的下一个节点赋值给要删除的上一个节点的pNext;

               if (nullptr != pCurNode)

               {

                       pCurLastNode->pNext = pCurNode->pNext;

                       //删除节点

                       delete pCurNode;

                       pCurNode = nullptr;

               }

               else

               {

                       cout << "未找到该序号";

               }

        }

}

void InsertList(sStudent *& pHead, int iIndex)

{

        sStudent* pNewNode = new sStudent;

        cout << "要插入节点的信息";

        cin >> pNewNode->iId;

        cin >> pNewNode->iGrade;

        if (0 == iIndex)

        {

               pNewNode->pNext = pHead;

               pHead = pNewNode;

               return;

        }

        else

        {

               sStudent* pCurNode = FindList(pHead, iIndex - 1);

               if (nullptr != pCurNode)

               {

                       pNewNode->pNext = pCurNode->pNext;

                       pCurNode->pNext = pNewNode;

               }

               else

               {

                       cout << "插入失败";

               }

        }

}

void ReversalList(sStudent *& pHead)

{

        //头结点

        sStudent* pHeadNode=pHead;

        //头结点

        sStudent* pHeadNode2 = pHead;

        //头结点

        sStudent* pHeadNode3 = pHead;

        //当前节点

        sStudent* pCurNode = pHead;

        //最后一个节点

        sStudent* pLastNode =new sStudent;

        //倒数第二个节点

        sStudent* pLastNode2 = new sStudent;

        int i = 0;

        //从头结点开始一直往后找，直到找到最后一个节点.当最初的头结点的pNext指向翻转后的节点时，循环结束

        while(nullptr != pHeadNode->pNext)

        {

               while (nullptr != pCurNode->pNext)

               {

                       pLastNode2 = pCurNode;

                       pLastNode  = pCurNode->pNext;

                       pCurNode = pCurNode->pNext;

               }

               pCurNode = pHeadNode;

               if (0 == i)

               {

                       pLastNode->pNext = pHeadNode;

                       pHeadNode2 = pLastNode;

                       pHeadNode3 = pLastNode;

               }

               else

               {

                       //此时将最后一个节点插入到头结点之前  

                       pLastNode->pNext = pHeadNode;

                       //重定义的头结点pNext指向插入头结点的最后一个节点

                       pHeadNode2->pNext = pLastNode;

                       //重定义的头结点变成已插进头结点之的节点

                       pHeadNode2 = pLastNode;

               }

               //倒数第二个节点置空

               pLastNode2->pNext = nullptr;

               i++;

        }

        cout << i;#include "stdafx.h"

#include<Windows.h>

#include<iostream>

using namespace std;

struct  sStudent

{

        sStudent()

        {

               iId = 0;

               //memset(szName, 0, sizeof(szName));

               iGrade = 0;

               pNext = nullptr;

        }

        int iId;

        //char szName[32];

        int iGrade;

        sStudent* pNext;

};

//创建链表

void CreateList(sStudent* pHeadNode,int iSize);

//遍历链表

void ViewList(sStudent* pHead);

//查找链表

sStudent* FindList(sStudent* pHead, int iIndex);

//删除链表

void DeleteList(sStudent*& pHead, int iIndex);

//插入链表

void InsertList(sStudent*& pHead, int iIndex);

//链表翻转

void ReversalList(sStudent*& pHead);

void ReversalList2(sStudent*& pHead);

sStudent* pHeadNode = new sStudent;//头结点

int main()

{

        pHeadNode->iId = 1;

        pHeadNode->iGrade = 1;

        int iLen = 0;

        int iFindLen = 0;

        int iDeleteLen = 0;

        int iInsertLen = 0;

        cout << "输入创建链表的长度：" << endl;

        cin >> iLen;

        CreateList(pHeadNode,iLen);

        /*cout << "输入查找链表的id：";

        cin >> iFindLen;

        sStudent* pFindNode= FindList(pHeadNode, iFindLen);

        if (nullptr != pFindNode)

        {

               cout << pFindNode->iId << "\t" << pFindNode->iGrade << endl;

        }

        else

        {

               cout << "找不到信息" << endl;

        }*/

        //cout << "所有链表的信息：" << endl;

        //ViewList(pHeadNode);

        //cout << "输入要删除的节点序号";

        //cin >> iDeleteLen;

        //DeleteList(pHeadNode, iDeleteLen);

        //cout << "所有链表的信息：" << endl;

        //ViewList(pHeadNode);

        /*cout << "输入要插入节点的位置";

        cin >> iInsertLen;

        InsertList(pHeadNode, iInsertLen);

        ViewList(pHeadNode);*/

        ReversalList2(pHeadNode);

        cout << "翻转后的所有链表的信息：" << endl;

        ViewList(pHeadNode);

        system("pause");

    return 0;

}

void CreateList(sStudent* pHeadNode, int iSize)

{       

        sStudent* pNextNode = pHeadNode;//下一节点

        int i = 1;

        int iCount = 1;

        while (i<iSize)

        {

               sStudent* pNewNode = new sStudent;

               cout << "输入第" << iCount << "节点的id" << endl;

               cin >> pNewNode->iId;

               cout << "输入第" << iCount << "节点的成绩" << endl;

               cin >> pNewNode->iGrade;

               pNextNode->pNext = pNewNode;

               pNextNode = pNewNode;

               i++;

               iCount++;

        }

}

void ViewList(sStudent* pHead)

{

        //当前节点，默认为头结点

        sStudent* pCurNode = pHead;

        int iCount=0;

        while (nullptr != pCurNode)

        {

               cout << "第" << iCount << "个节点"<<endl;

               cout << pCurNode->iId << "\t" << pCurNode->iGrade << endl;

               pCurNode = pCurNode->pNext;

               iCount++;

        }

}

sStudent* FindList(sStudent * pHead, int iIndex)

{

        sStudent* pCurNode =pHead;

        int iCount = 0;

        while (nullptr!=pCurNode)

        {

               if (iIndex == iCount)

               {

                       return pCurNode;

               }

               pCurNode = pCurNode->pNext;

               iCount++;

        }

        return nullptr;

}

void DeleteList(sStudent *& pHead, int iIndex)

{

        if (0 == iIndex)

        {

               pHead = pHead->pNext;

               delete pHead;

               pHead = nullptr;

               return;

        }

        else

        {

               //要删除的节点

               sStudent* pCurNode = FindList(pHead, iIndex);

               //要删除的上一个节点

               sStudent* pCurLastNode = FindList(pHead, iIndex - 1);

               //将要删除的下一个节点赋值给要删除的上一个节点的pNext;

               if (nullptr != pCurNode)

               {

                       pCurLastNode->pNext = pCurNode->pNext;

                       //删除节点

                       delete pCurNode;

                       pCurNode = nullptr;

               }

               else

               {

                       cout << "未找到该序号";

               }

        }

}

void InsertList(sStudent *& pHead, int iIndex)

{

        sStudent* pNewNode = new sStudent;

        cout << "要插入节点的信息";

        cin >> pNewNode->iId;

        cin >> pNewNode->iGrade;

        if (0 == iIndex)

        {

               pNewNode->pNext = pHead;

               pHead = pNewNode;

               return;

        }

        else

        {

               sStudent* pCurNode = FindList(pHead, iIndex - 1);

               if (nullptr != pCurNode)

               {

                       pNewNode->pNext = pCurNode->pNext;

                       pCurNode->pNext = pNewNode;

               }

               else

               {

                       cout << "插入失败";

               }

        }

}

void ReversalList(sStudent *& pHead)

{

        //头结点

        sStudent* pHeadNode=pHead;

        //头结点

        sStudent* pHeadNode2 = pHead;

        //头结点

        sStudent* pHeadNode3 = pHead;

        //当前节点

        sStudent* pCurNode = pHead;

        //最后一个节点

        sStudent* pLastNode =new sStudent;

        //倒数第二个节点

        sStudent* pLastNode2 = new sStudent;

        int i = 0;

        //从头结点开始一直往后找，直到找到最后一个节点.当最初的头结点的pNext指向翻转后的节点时，循环结束

        while(nullptr != pHeadNode->pNext)

        {

               while (nullptr != pCurNode->pNext)

               {

                       pLastNode2 = pCurNode;

                       pLastNode  = pCurNode->pNext;

                       pCurNode = pCurNode->pNext;

               }

               pCurNode = pHeadNode;

               if (0 == i)

               {

                       pLastNode->pNext = pHeadNode;

                       pHeadNode2 = pLastNode;

                       pHeadNode3 = pLastNode;

               }

               else

               {

                       //此时将最后一个节点插入到头结点之前  

                       pLastNode->pNext = pHeadNode;

                       //重定义的头结点pNext指向插入头结点的最后一个节点

                       pHeadNode2->pNext = pLastNode;

                       //重定义的头结点变成已插进头结点之的节点

                       pHeadNode2 = pLastNode;

               }

               //倒数第二个节点置空

               pLastNode2->pNext = nullptr;

               i++;

        }

        cout << i;

        pHead = pHeadNode3;

}

void ReversalList2(sStudent *& pHead)

{

        sStudent* pNextNode = pHead->pNext;

        sStudent* pNextNode2 = pHead->pNext->pNext;

        pHead->pNext = nullptr;

        pNextNode->pNext = pHead;

        pHead = pNextNode;

        while (nullptr != pNextNode2)

        {

        pNextNode = pNextNode2;

        pNextNode2 = pNextNode2->pNext;

        pNextNode->pNext = pHead;

        pHead = pNextNode;

        }

}

        pHead = pHeadNode3;

}

void ReversalList2(sStudent *& pHead)

{

        sStudent* pNextNode = pHead->pNext;

        sStudent* pNextNode2 = pHead->pNext->pNext;

        pHead->pNext = nullptr;

        pNextNode->pNext = pHead;

        pHead = pNextNode;

        while (nullptr != pNextNode2)

        {

        pNextNode = pNextNode2;

        pNextNode2 = pNextNode2->pNext;

        pNextNode->pNext = pHead;

        pHead = pNextNode;

        }

}

一杯82年的拉菲
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
C++链表
Foools的博客
11-17 1256
文章目录前言一、动态链表存储二、建立和遍历列表三、插入节点四、删除节点 前言 链表相对于列表，数组来说，访问不方便，长度可变，插入新元素方便。本文仅介绍单向列表。 一、动态链表存储 每个节点都需要存储后继节点的地址，让一个个元素串联起来，这样就能形成一个单向链表。 综上，单项列表的数据元素是一个结构： struct Node { char name[20]; double salary; Node * next; }; 二、建立和遍历列表 建立单向列表的过程可以描述为： 生成头结点； whil.
链表(C++)
qq_33204297的博客
02-22 1064
链表：数据区加地址区 不好意思，吃饭去了，明天继续
数据结构：链表详解 (c++实现)
最新发布
weixin_73162565的博客
07-12 1408
本文用通俗的语言加上图片展现的形式详细讲解链表，并且附上 C++ 实现代码。
链表（c++)
朱家小旺
10-10 317
一、单链表实现： #include<iostream> #include<vector> using namespace std; class intSLLnode { public: intSLLnode(){ next = 0; } intSLLnode(int i,intSLLnode *in = 0){info = i;next = in;} //private: int info; //用于存储信息 intSLLn
链表（c++）
HUGOPIGS的博客
01-15 272
数据结构--链表（c/c++）一、线性表（1）线性结构（2）合理的创建标题，有助于目录的生成如何改变文本的样式插入链接与图片如何插入一段漂亮的代码片生成一个适合你的列表创建一个表格设定内容居中、居左、居右SmartyPants创建一个自定义列表如何创建一个注脚注释也是必不可少的KaTeX数学公式新的甘特图功能，丰富你的文章UML 图表FLowchart流程图导出与导入导出导入 一、线性表 线性表（...
C++ 链表
热门推荐
m0_62175410的博客
07-26 3万+
C++链表笔记
C++实现链表版本通讯录
08-25
C++实现链表版本通讯录 本文主要介绍了使用C++实现链表版本通讯录的知识点，通过示例代码对链表版本通讯录的实现进行了详细的介绍，并提供了一定的参考价值。 链表基本概念 链表是一种数据结构，它由一系列节点...
C++链表倒序实现方法
09-04
通过这个实例，我们可以了解到C++链表操作的基本步骤和技巧，这对于深入理解数据结构和算法非常重要。在实际编程中，链表的倒序操作常被用于各种场景，如处理数据序列、实现队列和栈等。熟悉和掌握这些基本操作能够...
用类的方式实现C++链表功能
05-29
本教程将介绍如何使用类的方式来实现一个简单的C++链表，包括链表的创建、插入、删除、修改和查找操作。下面我们将详细探讨这些知识点。 首先，链表的核心是链表节点，通常我们定义一个结构体或类来表示节点，它...
C++实现静态链表
08-19
C++实现静态链表 在计算机科学中，链表是一种常用的数据结构，静态链表是链表的一种实现方式。静态链表是指链表的存储空间是在编译时确定的，它的结点数目固定不变。静态链表的实现可以使用数组来存储结点，结点...
c++链表的反转
09-04
c++链表的反转，创建链表，插入链表，链表反转，可下载直接运行。
c++链表
qq_19457459的博客
05-10 158
#include <iostream> #include <time.h> using namespace std; struct Node { int data; struct Node *next; }; typedef struct Node *LinkList; //定义LinkList类型 // 创建链表 // 头插法 void CreateListHead(LinkList *L, int n) { LinkList p; int i; *
单链表，循环链表，双链表及其基本操作（C++实现）
My vegetable has exploded.
07-16 8050
    最近在学习严蔚敏教授的《数据结构》，有一些感想，在这里写下来，留做笔记，希望能对以后学习有所帮助。     我们知道，线性表就是n个数据元素的有限序列，它有两种实现方式，其一为顺序表，即数组+伪指针的方式实现，另一为链表，采用的是指针的方式实现。由于顺序表的知识偏向基础且其应用灵活性不高，故在此不再介绍，本文主要说明几种常用的链表是如何实现的以及其基本操作。 1.单链表：     单...
C++之链表
gghhb12的博客
04-05 3039
C++之链表
C++实现链表：动态创建单向链表
"这篇资料主要介绍了链表的基本概念和如何在C++中建立单向链表，涵盖了链表的优势、动态内存分配、链表节点的定义以及如何通过编程实现链表的创建。" 链表是一种数据结构，它克服了数组预设大小的限制，允许在运行...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值