[hjeomdev] WEEK 04 solutions

merge-two-sorted-lists/hjeomdev.java

@@ -0,0 +1,28 @@
+/**
+ * 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 list = new ListNode(-1);
+        ListNode result = list;
+        while (list1 != null && list2 != null) {
+            if (list1.val < list2.val) {
+                result.next = list1;
+                list1 = list1.next;
+            } else {
+                result.next = list2;
+                list2 = list2.next;
+            }
+            result = result.next;
+        }
+        result.next = list1 != null ? list1 : list2;
+        return list.next;
+    }
+}