From ae30f13d44f8accfb03f073821a717ba5c86dc2b Mon Sep 17 00:00:00 2001
From: "hyeonchang.shin" <shinhc5@gmail.com>
Date: Sun, 19 Jul 2026 00:50:59 +0900
Subject: [PATCH] merge-two-sorted-lists solution

---
 merge-two-sorted-lists/togo26.js | 46 ++++++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 merge-two-sorted-lists/togo26.js

diff --git a/merge-two-sorted-lists/togo26.js b/merge-two-sorted-lists/togo26.js
new file mode 100644
index 0000000000..26d428c9a7
--- /dev/null
+++ b/merge-two-sorted-lists/togo26.js
@@ -0,0 +1,46 @@
+/**
+ * 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}
+ */
+
+// TC: O(n + m) / SC: O(1)
+var mergeTwoLists = function (list1, list2) {
+  let mergeHead = null;
+  let mergePointer = null;
+
+  let head1 = list1;
+  let head2 = list2;
+
+  const mergeNode = node => {
+    const temp = node.next;
+    if (!mergeHead) {
+      mergeHead = node;
+      mergePointer = node;
+    } else {
+      mergePointer.next = node;
+      mergePointer = mergePointer.next;
+    }
+    return temp;
+  };
+
+  while (head1 && head2) {
+    if (head1.val <= head2.val) {
+      head1 = mergeNode(head1);
+    } else {
+      head2 = mergeNode(head2);
+    }
+  }
+
+  if (head1) mergeNode(head1);
+  if (head2) mergeNode(head2);
+
+  return mergeHead;
+};