Merge k Sorted Lists
Solution
Verifying access...
Time Complexity
O(N log k)SPACE_COMPLEXITY: O(1)---PYTHON---Definition for singly-linked list.class ListNode:def init(self, val=0, next=None):self.val = valself.next = nextclass Solution:def mergeKLists(self, lists: List[Optional[ListNode]]) -> Optional[ListNode]:if not lists:return Nonedef mergeTwoLists(l1, l2):
Space Complexity
O(1)---PYTHON---Definition for singly-linked list.class ListNode:def init(self, val=0, next=None):self.val = valself.next = nextclass Solution:def mergeKLists(self, lists: List[Optional[ListNode]]) -> Optional[ListNode]:if not lists:return Nonedef mergeTwoLists(l1, l2):