-
Notifications
You must be signed in to change notification settings - Fork 0
/
merge-two-sorted-lists.py
45 lines (35 loc) · 1.13 KB
/
merge-two-sorted-lists.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
"""
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.
"""
from typing import Optional
# Definition for singly-linked list.
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
class Solution:
def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
# Handle edge cases
if not list1 and not list2:
return None
if not list1:
return list2
if not list2:
return list1
node = ListNode()
new_head = node
while list1 and list2:
if list1.val <= list2.val:
node.next = list1
list1 = list1.next
else:
node.next = list2
list2 = list2.next
node = node.next
if list1:
node.next = list1
elif list2:
node.next = list2
return new_head.next