commit

Author: bryanfks-dev

21. Merge Two Sorted Lists.java

@@ -0,0 +1,36 @@
+/**
+ * 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 head = new ListNode(); // Empty node
+        ListNode curr = head;
+
+        while (list1 != null && list2 != null) {
+            if (list1.val <= list2.val) {
+                curr.next = list1;
+
+                list1 = list1.next;
+            }
+            else {
+                curr.next = list2;
+
+                list2 = list2.next;
+            }
+
+            curr = curr.next;
+        }
+
+        // Append the remainning nodes
+        curr.next = (list1 == null) ? list2 : list1;
+
+        return head.next;
+    }
+}