Update MergeTwoSortedlinkedLists.java

Author: jainx24

LinkedList/MergeTwoSortedlinkedLists.java

@@ -1,7 +1,7 @@
 /*
 Merge two sorted linked lists
 
-You’re given the pointer to the head nodes of two sorted linked lists. 
+You’re given the pointer to the head nodes of two sorted linked lists. 
 The data in both lists will be sorted in ascending order. 
 Change the next pointers to obtain a single, merged linked list which also has data in ascending order. 
 Either head pointer given may be null meaning that the corresponding list is empty.
@@ -16,8 +16,7 @@ class Node {
 */
 
 Node mergeLists(Node headA, Node headB) {
-     // This is a "method-only" submission. 
-     // You only need to complete this method 
+    
     Node head = null;
     Node temp = null;