Replace nodes with duplicates in linked list

Given a linked list that contains some random integers from 1 to n with many duplicates. Replace each duplicate element that is present in the linked list with the values n+1, n+2, n+3 and so on(starting from left to right in the given linked list).

Examples:

Input : 1 3 1 4 4 2 1
Output : 1 3 5 4 6 2 7
Replace 2nd occurrence of 1 with 5 i.e. (4+1)
        2nd occurrence of 4 with 6 i.e. (4+2)
        3rd occurrence of 1 with 7 i.e. (4+3)

Input : 1 1 1 4 3 2 2
Output : 1 5 6 4 3 2 7

Approach :
1. Traverse the linked list, store the frequencies of every number present in linked list in a map and alongwith it find the maximum integer present in linked list i.e. maxNum.
2. Now, traverse the linked list again and if the frequency of any number is more than 1, set its value to -1 in map on its first occurrence.
3.The reason for this is that on next occurrence of this number we will find its value -1 which means this number has occurred before, change its data with maxNum + 1 and increment maxNum.

Below is the implementation of idea.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ Program to replace duplicates 
// in an unsorted linked list
#include <bits/stdc++.h>
using namespace std;
  
/* A linked list node */
struct Node {
    int data;
    struct Node* next;
};
  
// Utility function to create a new Node
struct Node* newNode(int data)
{
    Node* temp = new Node;
    temp->data = data;
    temp->next = NULL;
    return temp;
}
  
// Function to replace duplicates from a 
// linked list
void replaceDuplicates(struct Node* head)
{
    // map to store the frequency of numbers
    unordered_map<int, int> mymap;
  
    Node* temp = head;
  
    // variable to store the maximum number
    // in linked list
    int maxNum = 0;
  
    // traverse the linked list to store 
    // the frequency of every number and 
    // find the maximum integer
    while (temp) {
        mymap[temp->data]++;
        if (maxNum < temp->data)
            maxNum = temp->data;
        temp = temp->next;
    }
  
    // Traverse again the linked list
    while (head) {
      
        // Mark the node with frequency more
        // than 1 so that we can change the
        // 2nd occurence of that number
        if (mymap[head->data] > 1)
            mymap[head->data] = -1;
  
        // -1 means number has occurred 
        // before change its value
        else if (mymap[head->data] == -1)
            head->data = ++maxNum;
  
        head = head->next;
    }
}
  
/* Function to print nodes in a given
linked list */
void printList(struct Node* node)
{
    while (node != NULL) {
        printf("%d ", node->data);
        node = node->next;
    }
    cout << endl;
}
  
/* Driver program to test above function */
int main()
{
    /* The constructed linked list is:
    1->3->1->4->4->2->1*/
    struct Node* head = newNode(1);
    head->next = newNode(3);
    head->next->next = newNode(1);
    head->next->next->next = newNode(4);
    head->next->next->next->next = 
                                newNode(4);
    head->next->next->next->next->
                         next = newNode(2);
    head->next->next->next->next->
                   next->next = newNode(1);
  
    cout << "Linked list before replacing"
         << " duplicates\n";
    printList(head);
  
    replaceDuplicates(head);
  
    cout << "Linked list after replacing"
         << " duplicates\n";
    printList(head);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of the approach 
import java.util.*;
  
class GFG
{
      
// Representation of node 
static class Node 
    int data; 
    Node next; 
    Node(int d)
    {
        data = d;
        next = null;
    }
}; 
  
  
// Function to insert a node at the beginning 
static Node insert(Node head, int item) 
    Node temp = new Node(0); 
    temp.data = item; 
    temp.next = head; 
    head = temp;
    return head;
  
// Function to replace duplicates from a 
// linked list 
static void replaceDuplicates( Node head) 
    // map to store the frequency of numbers 
    Map<Integer, Integer> mymap = new HashMap<>(); 
  
    Node temp = head; 
  
    // variable to store the maximum number 
    // in linked list 
    int maxNum = 0
  
    // traverse the linked list to store 
    // the frequency of every number and 
    // find the maximum integer 
    while (temp != null
    
        mymap.put(temp.data,(mymap.get(temp.data) == 
                    null?0:mymap.get(temp.data))+1); 
        if (maxNum < temp.data) 
            maxNum = temp.data; 
        temp = temp.next; 
    
  
    // Traverse again the linked list 
    while (head != null)
    
      
        // Mark the node with frequency more 
        // than 1 so that we can change the 
        // 2nd occurence of that number 
        if (mymap.get(head.data) > 1
            mymap.put(head.data, -1); 
  
        // -1 means number has occurred 
        // before change its value 
        else if (mymap.get(head.data) == -1
            head.data = ++maxNum; 
  
        head = head.next; 
    
  
// Function to print nodes in a given 
//linked list /
static void printList( Node node) 
    while (node != null)
    
        System.out.printf("%d ", node.data); 
        node = node.next; 
    } System.out.println();
  
// Driver code 
public static void main(String args[])
    // The coned linked list is: 
    // 1->3->1->4->4->2->1/
    Node head = new Node(1); 
    head.next = new Node(3); 
    head.next.next = new Node(1); 
    head.next.next.next = new Node(4); 
    head.next.next.next.next = new Node(4); 
    head.next.next.next.next. 
                        next = new Node(2); 
    head.next.next.next.next. 
                next.next = new Node(1); 
  
    System.out.println( "Linked list before replacing"
        + " duplicates\n"); 
    printList(head); 
  
    replaceDuplicates(head); 
  
    System.out.println("Linked list after replacing"
        + " duplicates\n"); 
    printList(head); 
}
  
// This code is contributed by Arnab Kundu

chevron_right



Output:

Linked list before replacing duplicates
1 3 1 4 4 2 1 
Linked list after replacing duplicates
1 3 5 4 6 2 7 

This article is contributed by Chhavi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



My Personal Notes arrow_drop_up

Improved By : andrew1234



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.