shway
/
DSA
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update RemoveDuplicateLL.java 

The changes asked in the pull request is added.
pull/1095/head
Poonam Raghuvanshi 2023-01-03 00:12:46 +01:00 committed by GitHub
parent fa4bb4595e
commit a8075389a2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 19 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
algorithms/Java/linked-lists/RemoveDuplicateLL.java
View File

@ -1,3 +1,7 @@
import java.util.Scanner;
/* The RemoveDuplicateLL removes the duplicate elements from a singly linkedlist. In order to remove the duplicates
we first sort the list using the merge sort. The time Complexity for the merge sort is O(n*log n) and
space complexity is O(log n); from the sorted list to remove the duplicate elements the time complexity is O(n). */
public class RemoveDuplicateLL { public class RemoveDuplicateLL {
private Node head = null; private Node head = null;
class Node { class Node {
@ -19,14 +23,13 @@ public class RemoveDuplicateLL {
} }
/* Sort the list using merge sort it O(n logn)*/ /* To sort remove the duplicates from the linkedlist it would be better to sort it in O(n logn)*/
Node sortedMerge(Node first, Node second) { Node sortedMerge(Node first, Node second) {
Node result; Node result;
if (first == null) if (first == null)
return second; return second;
if (second == null) if (second == null)
return first; return first;
/* Choose the list which contains smaller elements */ /* Choose the list which contains smaller elements */
if (first.data <= second.data) { if (first.data <= second.data) {
result = first; result = first;
@ -66,12 +69,11 @@ public class RemoveDuplicateLL {
return slow; return slow;
} }
/* To sort remove the duplicates in O(n)*/ /* To remove the duplicates in O(n)*/
public Node removeDuplicates(Node head) { public Node removeDuplicates() {
if(head == null) { if(head == null) {
return null; return null;
} }
Node ptr = head; Node ptr = head;
while (ptr.next != null) { while (ptr.next != null) {
if(ptr.data == ptr.next.data) { if(ptr.data == ptr.next.data) {
@ -89,7 +91,7 @@ public class RemoveDuplicateLL {
if(head == null) return; if(head == null) return;
System.out.print("[ "); System.out.print("[ ");
while(pointer != null) { while(pointer != null) {
System.out.print(pointer.data + " "); System.out.print(" "+pointer.data + " ");
pointer = pointer.next; pointer = pointer.next;
} }
System.out.println("]"); System.out.println("]");
@ -97,30 +99,25 @@ public class RemoveDuplicateLL {
public static void main(String [] args) { public static void main(String [] args) {
RemoveDuplicateLL list = new RemoveDuplicateLL(); RemoveDuplicateLL list = new RemoveDuplicateLL();
list.addNode(9); System.out.print("Enter the length of list : ");
list.addNode(2); Scanner sc=new Scanner(System.in);
list.addNode(7); int length = sc.nextInt();
list.addNode(1); for(int i=0; i<length; i++) {
list.addNode(8); list.addNode( sc.nextInt());
list.addNode(3); }
list.addNode(7);
list.addNode(5);
list.addNode(4);
list.addNode(8);
list.addNode(1);
System.out.print("input : "); System.out.print("input : ");
list.print(); list.print();
System.out.print("sorted : "); System.out.print("sorted : ");
list.mergeSortList(list.head); list.head= list.mergeSortList(list.head);
list.print(); list.print();
System.out.print("remove duplicates : "); System.out.print("remove duplicates : ");
list.removeDuplicates(list.head); list.removeDuplicates();
list.print(); list.print();
} }
/* Output /* Output
input : [ 1 8 4 5 7 3 8 1 7 2 9 ] input : [ 2 1 0 3 1 9 0 0 9 ]
sorted : [ 1 1 2 3 4 5 7 7 8 8 9 ] sorted : [ 0 0 0 1 1 2 3 9 9 ]
remove dupliactes : [ 1 2 3 4 5 7 8 9 ] remove duplicates : [ 0 1 2 3 9 ]
*/ */
} }