Runtime: 1 ms (Top 80.18%) | Memory: 43.5 MB (Top 22.48%)

Author: AnasImloul

scripts/algorithms/M/Merge Two Sorted Lists/Merge Two Sorted Lists.java

@@ -1,16 +1,17 @@
+// Runtime: 1 ms (Top 80.18%) | Memory: 43.5 MB (Top 22.48%)
 class Solution {
-    public ListNode mergeTwoLists(ListNode list1, ListNode list2) 
+    public ListNode mergeTwoLists(ListNode list1, ListNode list2)
     {
         if(list1==null && list2==null)
             return null;
         if(list1 == null)
             return list2;
         if(list2 == null)
             return list1;
-        
+
         ListNode newHead = new ListNode();
         ListNode newNode = newHead;
-                
+
         while(list1!=null && list2!=null)
         {
             //ListNode newNode = new ListNode();
@@ -32,4 +33,4 @@ else if(list2!=null)
             newNode.next = list2;
         return newHead.next;
     }
-}
+}