Definition for singly-linked list. · cho.sh

Definition for singly-linked list.

Warning

This post is more than a year old. Information may be outdated.

Solved at: 220713

Question

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

Solution

Backlinks2

220713 Coding Tests

Comments0

No comments yet. Be the first to share your thoughts.

Comments

python

class Solution:
    def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
        cur = dummy = ListNode()
        while list1 and list2:
            if list1.val < list2.val:
                cur.next = list1
                list1, cur = list1.next, list1
            else:
                cur.next = list2
                list2, cur = list2.next, list2

        if list1 or list2:
            cur.next = list1 if list1 else list2

        return dummy.next

Definition for singly-linked list.

Question

Solution

Results

Runtime

Memory Usage

Other Answers Online