完整功能单链表

#include <iostream>
#include <iomanip>
using namespace std;
class Node
{
public:
    int Value;   //当前节点储存的值
    Node *pNext; //下一节点位置
};
class LinkList
{
private:
    Node *pHead;

public:
    int Push(int InValue);                //头插节点
    LinkList();                           //构造函数
    LinkList(const LinkList &);           //复制构造函数
    LinkList operator=(const LinkList &); //赋值运算符重载
    ~LinkList();                          //析构函数
    bool IsEmpty();                       //判空
    void Display();                       //遍历打印
    void Erase(int DeValue);              //删除
    Node *Find(int Value)                 //查找
    {
        Node *p = pHead;
        while (p->Value != Value && p != NULL) //
        {                                      //当前节点数据不是要查找的数据并且不指向NULL
            p = p->pNext;
        }
        if (!p)          // p==NULL
            return NULL; //返回空指针
        else
            return p;
    }
    bool IsOrder(); //判断链表是否有序
    void ReSort();  //链表反序
};
/************************************************************************/
void LinkList::ReSort()
{
    Node *p1 = pHead, *p2 = pHead->pNext;
    while (p2 != NULL)
    {
        Push(p2->Value);
        p1->pNext = p2->pNext;
        Node *temp = p2;
        p2 = p2->pNext;
        delete temp;
    }
}
bool LinkList::IsOrder()
{
    if (!pHead) //空链表直接返回false
    {
        cout << "***********空链表！\n";
        return false;
    }

    Node *p1 = pHead, *p2 = pHead->pNext;
    if (p1->Value > p2->Value) //前两个节点的数据大小关系
    {
        p1 = p1->pNext;
        p2 = p2->pNext;
        while (p2->pNext != NULL)
        {
            if (p1->Value < p2->Value) //后面相邻两个节点数据的大小关系与头部两个节点不同
            {
                cout << "无序！\n"; //判断为无序
                return false;
            }

            p1 = p1->pNext;
            p2 = p2->pNext;
        }
        cout << "降序！\n";
    }
    else
    {
        p1 = p1->pNext;
        p2 = p2->pNext;
        while (p2->pNext != NULL)
        {
            if (p1->Value > p2->Value)
            {
                cout << "无序！\n";
                return false;
            }
            p1 = p1->pNext;
            p2 = p2->pNext;
        }
        cout << "升序！\n";
    }
    return true;
}
/*************************************************************************************/

void LinkList::Display() //遍历输出
{
    //从第一个节点依次遍历
    Node *pPtr = pHead;
    while (pPtr != NULL)
    {
        cout << setw(4) << pPtr->Value; //输出节点数据
        pPtr = pPtr->pNext;
    }
    cout << '\n'
         << '\n';
}
void LinkList::Erase(int DelValue)
{
    int Flag = 0;
    Node *DelPos, *PrevPos = NULL;
    DelPos = pHead;
    while (DelPos != NULL)
    {
        if (DelPos->Value == DelValue)
        {
            if (PrevPos != NULL)
                PrevPos->pNext = DelPos->pNext;
            else // PrevPos仍为NULL，表明删除的是第一个节点
                pHead = pHead->pNext;
            delete DelPos;
            Flag = 1;
            break;
        }
        PrevPos = DelPos;
        DelPos = DelPos->pNext;
    }
    if (!Flag)
        cout << "链表节点中不存在数据" << DelValue << "!\n\n";
    return;
}
LinkList::LinkList() //构造函数
{
    pHead = NULL;
}
LinkList::LinkList(const LinkList &a) //复制构造函数
{
    if (!a.pHead)
    {
        cout << "***********空链表！\n";
    }
    else
    {
        pHead = new Node();
        pHead->pNext = NULL;
        Node *p1 = pHead;
        Node *p2 = a.pHead->pNext;
        pHead->Value = a.pHead->Value; //复制头节点数据
        while (p2)                     //下一节点不为空
        {
            p1->pNext = new Node(); //开辟新空间
            p1 = p1->pNext;
            p1->Value = p2->Value; //复制节点数据
            p1->pNext = NULL;      //默认下一节点为空
            p2 = p2->pNext;
        }
    }
}
LinkList LinkList::operator=(const LinkList &a) //=号重载
{
    return a;
}
LinkList::~LinkList() //析构函数
{
    while (pHead != NULL)
    {
        Node *pTmp = pHead->pNext; //记录当前节点的下一位置
        delete pHead;              //删除当前节点
        pHead = pTmp;
    }
}
bool LinkList::IsEmpty()
{
    if (!pHead)
    {
        cout << "***********空链表！\n";
        return true;
    }
    else
    {
        cout << "***********非空链表！\n";
        return false;
    }
}
int LinkList::Push(int InValue)
{
    Node *NewNode = new Node;
    NewNode->Value = InValue;
    NewNode->pNext = NULL;
    Node *pTmp = pHead;
    pHead = NewNode;
    pHead->pNext = pTmp; //把新增的节点放到首位
    return InValue;
}
int main()
{
    LinkList link1;
    link1.IsOrder();
    for (int i = 1; i < 10; i++)
        link1.Push(i * i);
    cout << "插入所有节点后:\n";
    link1.Display();
    link1.IsOrder();
    link1.ReSort();
    link1.Display();
    link1.IsOrder();
    link1.Push(33);
    link1.Display();
    link1.IsOrder();
    link1.ReSort();
    link1.Display();
    /*link1.Erase(1);
    link1.Erase(81);
    link1.Erase(25);
    link1.Erase(24);
    cout << "删除部分节点后:\n";
    link1.Display();
    LinkList link2(link1);//复制构造
    cout << "复制构造后的新链表:\n";
    link2.Display();
    LinkList link3 = link2;//赋值运算
    cout << "赋值后的新链表:\n";
    link3.Display();
    cout << "判空:\n";
    link3.IsEmpty();//判空
    LinkList link4;
    link4.IsEmpty();//判空
    cout << "\n查找数据9所在节点：\n";
    Node* newnode = link3.Find(9);//查找
    cout << "\n找到符合条件的节点内的数据："<<newnode->Value << '\n';*/
    return 0;
}