[Leetcode - Easy] Merge Two Sorted Lists (#11)

bangdori/Merge Two Sorted Lists.js

@@ -0,0 +1,40 @@
+/**
+ * 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) {
+  if (!list1) return list2;
+  if (!list2) return list1;
+
+  let list = new ListNode();
+  const head = list;
+
+  while (list1 && list2) {
+    if (list1.val < list2.val) {
+      list.next = list1;
+      list1 = list1.next;
+    } else {
+      list.next = list2;
+      list2 = list2.next;
+    }
+
+    list = list.next;
+  }
+
+  if (!list1) {
+    list.next = list2;
+  }
+  if (!list2) {
+    list.next = list1;
+  }
+
+  return head.next;
+};