We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Delete duplicate-value nodes from a sorted linked list
  5. Discussions

Delete duplicate-value nodes from a sorted linked list

Sort by

recency

|

910 Discussions

|

  • saptgiri7
     + 0 comments
    SinglyLinkedListNode* removeDuplicates(SinglyLinkedListNode* llist) {
    SinglyLinkedListNode *current = llist, *prev = NULL ;
    
    while(current->next != 0){
        prev = current;
        current = current->next;
        if(prev->data == current->data){
            prev->next = current->next;
            current = prev;
        }
    }
    
    return llist;
}

  • joshwelchall
     + 0 comments

    Hi There i am try to make a search box just link any one who can make me code like this .... thanks

    Source https://statesmd.com/specialties/

  • lonzobrown98
     + 0 comments

    Hi There i am try to make a search box just link any one who can make me code like this .... thanks

  • ahmedsamir99sh11
     + 0 comments
        SinglyLinkedListNode* temp1;
    temp1=llist;
    
    while(temp1!=nullptr&&temp1->next!=nullptr)
    {
        if(temp1->data==temp1->next->data)
        {
            temp1->next=temp1->next->next;
        }else
        {
            temp1=temp1->next;
        }
            
    }
    
    return llist;
}

  • robert_portilho
     + 0 comments

    Here, my solution:

    SinglyLinkedListNode* removeDuplicates(SinglyLinkedListNode* llist) {
    SinglyLinkedListNode* prev;
    SinglyLinkedListNode* curr = llist;
    
    while(curr != NULL) {
        prev = curr;
        curr = curr->next;
        
        while(curr != NULL && curr->data == prev->data){
            prev->next = curr->next;
            curr = curr->next;
        }
    }
    
    return llist;
}