Time: 2 ms (12.14%), Space: 57.8 MB (43.15%) - LeetHub

    source:122eeb8d4639169f99ce15c3071d1995ae0c98d2

Author: yeyounging

공예영/5주차/0021-merge-two-sorted-lists/0021-merge-two-sorted-lists.js

@@ -0,0 +1,31 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} list1
+ * @param {ListNode} list2
+ * @return {ListNode}
+ */
+var mergeTwoLists = function(list1, list2) {
+        let dummy = new ListNode(0);
+        let tail = dummy;
+
+        while (list1 !== null && list2 !== null) {
+            if (list1.val < list2.val) {
+                tail.next = list1;
+                list1 = list1.next;
+            } else {
+                tail.next = list2;
+                list2 = list2.next;
+            }
+            tail = tail.next;
+        }
+
+        tail.next = (list1 !== null) ? list1 : list2;
+
+        return dummy.next;
+};