add complexity

jylee2033 · jylee2033 · commit 425459bd4957 · 2026-03-24T00:53:08.000-07:00
diff --git a/merge-two-sorted-lists/jylee2033.py b/merge-two-sorted-lists/jylee2033.py
@@ -25,3 +25,6 @@ def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) ->
         cur.next = list1 or list2
 
         return output.next
+
+# Time Complexity : O(n + m), n - lenght of list1, m - length of list2
+# Space Complexity : O(1)
