Time: 1 ms (82.48%), Space: 43.2 MB (39.72%) - LeetHub

Author: ahmeddhus

0021-merge-two-sorted-lists/0021-merge-two-sorted-lists.java

@@ -0,0 +1,38 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
+        ListNode tempNode = new ListNode(0);
+        ListNode currentNode = tempNode;
+        
+        while(list1 != null && list2 != null) {
+            if(list1.val < list2.val) {
+                currentNode.next = list1;
+                list1 = list1.next;
+            } else {
+                currentNode.next = list2;
+                list2 = list2.next;
+            }
+            currentNode = currentNode.next;
+        }
+        
+        if(list1 != null) {
+            currentNode.next = list1;
+            list1 = list1.next;
+        }  else if(list2 != null){
+            currentNode.next = list2;
+            list2 = list2.next;
+        }
+        
+        return tempNode.next;
+       
+    }
+}