Title: Remove duplicates from an unsorted linked list Source: www.geeksforgeeks.org
Write a removeDuplicates() function which takes a list and deletes any duplicate nodes from the list. The list is not sorted.
For example if the linked list is 12->11->12->21->41->43->21 then removeDuplicates() should convert the list to 12->11->21->41->43.
METHOD 1 (Using two loops)
This is the simple way where two loops are used. Outer loop is used to pick the elements one by one and inner loop compares the picked element with rest of the elements.
Time Complexity: O(n^2)
METHOD 2 (Use Sorting)
In general, Merge Sort is the best suited sorting algorithm for sorting linked lists efficiently.
1) Sort the elements using Merge Sort. We will soon be writing a post about sorting a linked list. O(nLogn)
2) Remove duplicates in linear time using the algorithm for removing duplicates in sorted Linked List. O(n)
Please note that this method doesn’t preserve the original order of elements.
Time Complexity: O(nLogn)
METHOD 3 (Use Hashing)
We traverse the link list from head to end. For every newly encountered element, we check whether it is in the hash table: if yes, we remove it; otherwise we put it in the hash table.
Java solution
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 |
/* http://www.geeksforgeeks.org/remove-duplicates-from-an-unsorted-linked-list/ */ //the idea is to use hashset, loop through each node and check whether //the node is already present in the hashset or not //if present then delete the node from hashset //otherwise add it to hashset import java.util.HashSet; import java.util.Set; public class DeleteDuplicateFromUnsortedList { public void deleteDuplicates(ListNode head) { if(head == null || head.next == null) return; Set<Integer> set = new HashSet<Integer>(); ListNode p = head; while(p != null) { printLinkedList(head); if(!set.contains(p.val)) { set.add(p.val); p = p.next; } else { ListNode p2 = head; while(p2.next!=p) p2 = p2.next; p2.next = p.next; p = p2.next; } } } public static void main(String args[]) { //12->11->12->21->41->43->21 ListNode head = new ListNode(12); head.next = new ListNode(11); head.next.next = new ListNode(12); head.next.next.next = new ListNode(21); head.next.next.next.next = new ListNode(41); head.next.next.next.next.next = new ListNode(43); head.next.next.next.next.next.next = new ListNode(21); DeleteDuplicateFromUnsortedList d = new DeleteDuplicateFromUnsortedList(); d.deleteDuplicates(head); d.printLinkedList(head); } public void printLinkedList(ListNode head) { ListNode p = head; while(p!=null) { System.out.print(p.val + "\t"); p = p.next; } System.out.println(); } } class ListNode { int val; ListNode next; ListNode(int val) { this.val = val; } } |