删除链表中重复的结点

#include <iostream>
using namespace std;

struct node
{
    int data;
    struct node *next;
};
class Solution
{
    public:
        Solution();
        void create();
        void print();
        void delete_node(struct node *n);//删除链表中的结点 
        void delete_repate();//删除链表中重复的结点 
        node *head;
};
Solution::Solution()
{
    head=new node();
    head->next=nullptr;
    head->data=0;
}
void Solution::create()
{
    if(head==nullptr)
        return;
    auto t=head;
    int x;
    while(1)
    {
        cin>>x;
        if(x)
        {
            t->next=new node();
            t=t->next;
            t->data=x;
            t->next=nullptr;
        }
        else
        {
            t->next=nullptr;
            break;
        }
    }
} 
void Solution::print()
{
    auto n=head;
    while(n)
    {
        cout<<n->data<<endl;
        n=n->next;
    }
}
//把要删除的结点的下一结点的值复制到要删除的结点，然后把要删除的结点的下一结点删除 
void Solution::delete_node(struct node *n)//删除链表中的结点 
{
    if(head==nullptr||n==nullptr)
        return;
    if(n->next!=nullptr)//要删除的结点不是尾结点
    {
        auto pnext=n->next;
        n->data=pnext->data;
        n->next=pnext->next;
        
        delete pnext;
        pnext=nullptr;
    }
    else if(n==head)//要删除结点是头结点
    {
        auto t=head;
        head=head->next;
        delete t;
        t=nullptr;
    }
    else//删除的是尾结点 
    {
        auto pnext=head;
        while(pnext->next!=n)
            pnext=pnext->next;
        
        pnext->next=nullptr;
        delete n;
        n=nullptr;
    }
}
//
void Solution::delete_repate()
{
    if(head==nullptr)
        return;
        
    struct node *pre=nullptr;//pre始终确保与下一个 没有重复的结点相连接 
    auto curr=head;
    
    while(curr!=nullptr)
    {
        auto pnext=curr->next;
        bool to_delete=false;
        if(pnext!=nullptr&&curr->data==pnext->data)
            to_delete=true;
        if(!to_delete)
        {
            pre=curr;
            curr=curr->next;
        }
        else
        {
            int data=curr->data;
            auto del=curr;
            while(del!=nullptr&&del->data==data)
            {
                pnext=del->next;
                delete del;
                del=nullptr;
                del=pnext;
            }
            if(pre==nullptr)
                pre=pnext;
            else
                pre->next=pnext;
            curr=pnext;
        }
    }
}
int main()
{
    Solution s;
    s.create();
    s.delete_node(s.head);
    s.delete_repate();
    s.print();
    
    return 0;
}