CareerCup-2.1-优快云博客

本文介绍了一种在未排序链表中去除重复元素的方法，并提供了一个C++实现示例。该算法通过遍历链表并删除重复节点来保证每个元素只出现一次。此外，还探讨了不允许使用临时缓冲区的情况下的解决方案。

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

Write code to remove duplicates from an unsorted linked list.

FOLLOW UP How would you solve this problem if a temporary buffer is not allowed?

#include <iostream>  
using namespace std;  

// Creating a Linked List:  
struct Node  
{  
    Node(int d):data(d){next = NULL;};  
    int data;  
    Node* next;  
};  

void printNode(Node* head)  
{  
    cout<<"Print:"<<endl;  
    while(head != NULL)  
    {  
        cout<<head->data<<endl;  
        head = head->next;  
    }  
    cout<<"End"<<endl;  
};  

// Deleting a Node from a Singly Linked List  
bool deleteFromPre(Node** head, Node* pre)  
{  
    if(*head == NULL || pre == NULL)  
        return false;  
    Node *p;  
    if((*head) == pre)  
    {  
        p = *head;  
        *head = p->next;   
        delete p;  
        return true;  
    }  
    if(pre->next == NULL)  
        return false;  
    p = pre->next;  
    pre->next = pre->next->next;  
    delete p;  
    return true;  
};  

void removeDuplicates(Node** head)  
{  
    if(head == NULL)  
        return;   
    Node *p, *q;  
    for(p = *head; p != NULL; p = p->next)  
    {  
        for(q = p; q->next != NULL; q = q->next)  
        {  
            if(p->data == q->next->data)  
            {  
                deleteFromPre(head, q);  
                // 这里栽跟头了 删除操作后无法保证q->next不为空   
                if(q->next == NULL)  
                    break;  
            }             
        }  
    }  
};  

int main()  
{  
    Node* head = new Node(2);  
    head->next = new Node(4);  
    head->next->next = new Node(4);  
    printNode(head);  
    removeDuplicates(&head);  
    printNode(head);          
    system("pause");   
};