Update Merge Two Sorted Lists - Leetcode 21.py

rai-abhi24 · web-flow · commit 46b07a021c8c · 2024-05-12T08:56:50.000+05:30
diff --git a/Merge Two Sorted Lists - Leetcode 21.py b/Merge Two Sorted Lists - Leetcode 21.py
@@ -16,3 +16,6 @@ def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) ->
         cur.next = list1 if list1 else list2
 
         return d.next
+
+# Time Complexity: O(n)
+# Space Complexity: O(1)
