Javatpoint Logo
Javatpoint Logo

Program to remove duplicate elements from a singly linked list

Explanation

In this program, we need to remove the duplicate nodes from the given singly linked list.

Original List:

Program to remove duplicate elements from a singly linked list

List after removing duplicate nodes:

Program to remove duplicate elements from a singly linked list

In the above list, node 2 is repeated thrice, and node 1 is repeated twice. Node current will point to head, and index will point to node next to current. Start traversing the list till a duplicate is found that is when current's data is equal to index's data. In the above example, the first duplicate will be found at position 4. Assign current to another node temp. Connect temp's next node with index's next node. Delete index which was pointing to duplicate node. This process will continue until all duplicates are removed.

Algorithm

  1. Create a class Node which has two attributes: data and next. Next is a pointer to the next node in the list.
  2. Create another class RemoveDuplicate which has two attributes: head and tail.
  3. addNode() will add a new node to the list:
    1. Create a new node.
    2. It first checks, whether the head is equal to null which means the list is empty.
    3. If the list is empty, both head and tail will point to a newly added node.
    4. If the list is not empty, the new node will be added to end of the list such that tail's next will point to a newly added node. This new node will become the new tail of the list.
  4. removeDuplicate() will remove duplicate nodes from the list.
    1. Define a new node current which will initially point to head.
    2. Node temp will point to current and index will always point to node next to current.
    3. Loop through the list till current points to null.
    4. Check whether current?s data is equal to index's data that means index is duplicate of current.
    5. Since index points to duplicate node so skip it by making node next to temp to will point to node next to index, i.e. temp.next = index.next.
  5. display() will display the nodes present in the list:
    1. Define a node current which will initially point to the head of the list.
    2. Traverse through the list till current points to null.
    3. Display each node by making current to point to node next to it in each iteration.

Solution

Python

Output:

 Originals list: 
1 2 3 2 2 4 1 
List after removing duplicates: 
1 2 3 4 

C

Output:

Originals list: 
1 2 3 2 2 4 1 
List after removing duplicates: 
1 2 3 4 

JAVA

Output:

Originals list: 
1 2 3 2 2 4 1 
List after removing duplicates: 
1 2 3 4 

C#

Output:

Originals list: 
1 2 3 2 2 4 1 
List after removing duplicates: 
1 2 3 4 

PHP

Output:

 Originals list: 
1 2 3 2 2 4 1 
List after removing duplicates: 
1 2 3 4 

Next Topic#




Please Share

facebook twitter google plus pinterest

Learn Latest Tutorials


Preparation


B.Tech / MCA