非递减单链表删除重复元素 -转

最新推荐文章于 2023-10-05 20:31:07 发布

weixin_30354675

最新推荐文章于 2023-10-05 20:31:07 发布

阅读量340

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/luquanmingren/archive/2013/01/04/2843689.html

本文介绍了一个简单的链表实现，包括添加元素和去除重复元素的功能。通过C++代码展示了如何构建链表，并实现了去除重复项的方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

    typedef struct _MyListNode
    {
        int nData;
        struct _MyListNode * pNext;
    } MyListNode, *PMyListNode;


    class MyList
    {
    public:
        MyList()
        {
            pHead = new MyListNode();
            pHead->nData = 0;
            pHead->pNext = NULL;
            pTail = NULL;
        }
        ~MyList()
        {
            MyListNode * pTmp = pHead;
            while (pTmp != NULL)
            {
                pHead = pTmp->pNext;
                delete pTmp;
                pTmp = pHead;
            }

            pHead = NULL;
        }

        void Append(int num)
        {
            MyListNode * pTmp = new MyListNode();
            pTmp->nData = num;
            pTmp->pNext = NULL;

            if (pTail != NULL)
            {
                pTail->pNext = pTmp;
            }
            else
            {
                pHead->pNext = pTmp;
            }
            pTail = pTmp;
        }

        void Print()
        {
            MyListNode * pTmp = pHead->pNext;
            while (pTmp != NULL)
            {
                cout << pTmp->nData << " ";
                pTmp = pTmp->pNext;
            }
            cout << endl;
        }

        void RemoveRepeat()
        {
            MyListNode * pNode = pHead->pNext;
            while (pNode != NULL)
            {
                MyListNode * pTmp = pNode->pNext;
                while (pTmp != NULL && pNode->nData == pTmp->nData)
                {
                    pNode->pNext = pTmp->pNext;
                    delete pTmp;
                    pTmp = pNode->pNext;
                }

                pNode = pTmp;
            }
        }
    private:
        MyListNode * pHead;
        MyListNode * pTail;

    };


    int main()
    {
        MyList lst;
        lst.Append(7);
        lst.Append(10);
        lst.Append(10);
        lst.Append(21);
        lst.Append(30);
        lst.Append(42);
        lst.Append(42);
        lst.Append(42);
        lst.Append(51);
        lst.Append(70);

        lst.Print();

        lst.RemoveRepeat();
        lst.Print();

        return 0;
    }