def test_merge_two_sorted_lists_1():
l1 = ListNode(1, ListNode(2, ListNode(4)))
l2 = ListNode(1, ListNode(3, ListNode(4)))
expected = ListNode(
1, ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(4)))))
)
actual = merge_two_lists(l1, l2)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_remove_linked_list_elements_1():
head = ListNode(
1,
ListNode(
2, ListNode(6, ListNode(3, ListNode(4, ListNode(5,
ListNode(6)))))))
val = 6
expected = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))
actual = remove_elements(head, val)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_remove_duplicates_from_sorted_list_5():
head = ListNode(
-53,
ListNode(
-23,
ListNode(
-23,
ListNode(
-17,
ListNode(
-1,
ListNode(
4,
ListNode(
4,
ListNode(
17,
ListNode(
65,
ListNode(
78,
ListNode(78, ListNode(99, ListNode(100))),
),
),
),
),
),
),
),
),
),
)
expected = ListNode(
-53,
ListNode(
-23,
ListNode(
-17,
ListNode(
-1,
ListNode(
4,
ListNode(
17, ListNode(65, ListNode(78, ListNode(99, ListNode(100))))
),
),
),
),
),
)
actual = delete_duplicates(head)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_merge_k_sorted_lists_1():
l1 = ListNode(1, ListNode(4, ListNode(5)))
l2 = ListNode(1, ListNode(3, ListNode(4)))
l3 = ListNode(2, ListNode(6))
lists = [l1, l2, l3]
expected = ListNode(
1,
ListNode(
1,
ListNode(
2,
ListNode(3, ListNode(4, ListNode(4, ListNode(5,
ListNode(6)))))),
),
)
actual = merge_k_lists(lists)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_remove_duplicates_from_sorted_list_6():
head = ListNode(
1,
ListNode(
1,
ListNode(
1,
ListNode(
1,
ListNode(
1,
ListNode(
1,
ListNode(
2,
ListNode(
3,
ListNode(
3,
ListNode(
3,
ListNode(
3,
ListNode(
3,
ListNode(
3, ListNode(3, ListNode(3))
),
),
),
),
),
),
),
),
),
),
),
),
)
expected = ListNode(1, ListNode(2, ListNode(3)))
actual = delete_duplicates(head)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_add_two_numbers_3():
l1 = ListNode(
9,
ListNode(
9, ListNode(9, ListNode(9, ListNode(9, ListNode(9,
ListNode(9)))))))
l2 = ListNode(9, ListNode(9, ListNode(9, ListNode(9))))
expected = ListNode(
8,
ListNode(
9,
ListNode(
9,
ListNode(9, ListNode(0, ListNode(0, ListNode(0,
ListNode(1)))))),
),
)
actual = add_two_numbers(l1, l2)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_remove_duplicates_from_sorted_list_3():
head = None
expected = None
actual = delete_duplicates(head)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_remove_linked_list_elements_3():
head = ListNode(7, ListNode(7, ListNode(7, ListNode(7))))
val = 7
expected = None
actual = remove_elements(head, val)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_merge_two_sorted_lists_5():
l1 = ListNode(
-42,
ListNode(
-0,
ListNode(
1, ListNode(7, ListNode(37, ListNode(42, ListNode(49, ListNode(52)))))
),
),
)
l2 = ListNode(
-71,
ListNode(
-52,
ListNode(
-21,
ListNode(4, ListNode(10, ListNode(41, ListNode(55, ListNode(100))))),
),
),
)
expected = ListNode(
-71,
ListNode(
-52,
ListNode(
-42,
ListNode(
-21,
ListNode(
0,
ListNode(
1,
ListNode(
4,
ListNode(
7,
ListNode(
10,
ListNode(
37,
ListNode(
41,
ListNode(
42,
ListNode(
49,
ListNode(
52,
ListNode(55, ListNode(100)),
),
),
),
),
),
),
),
),
),
),
),
),
),
)
actual = merge_two_lists(l1, l2)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_merge_two_sorted_lists_4():
l1 = ListNode(0)
l2 = None
expected = ListNode(0)
actual = merge_two_lists(l1, l2)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_merge_two_sorted_lists_2():
l1 = None
l2 = None
expected = None
actual = merge_two_lists(l1, l2)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_add_two_numbers_1():
l1 = ListNode(2, ListNode(4, ListNode(3)))
l2 = ListNode(5, ListNode(6, ListNode(4)))
expected = ListNode(7, ListNode(0, ListNode(8)))
actual = add_two_numbers(l1, l2)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_remove_linked_list_elements_2():
head = None
val = 1
expected = None
actual = remove_elements(head, val)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_remove_linked_list_elements_4():
head = ListNode(1)
val = 5
expected = ListNode(1)
actual = remove_elements(head, val)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_merge_k_sorted_lists_3():
lists = [None]
expected = None
actual = merge_k_lists(lists)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_reverse_linked_list_1():
head = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))
expected = ListNode(5, ListNode(4, ListNode(3, ListNode(2, ListNode(1)))))
actual = reverse_list(head)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_reverse_linked_list_4():
head = ListNode(1)
expected = ListNode(1)
actual = reverse_list(head)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_reverse_linked_list_3():
head = None
expected = None
actual = reverse_list(head)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_add_two_numbers_2():
l1 = ListNode(0)
l2 = ListNode(0)
expected = ListNode(0)
actual = add_two_numbers(l1, l2)
assert compare_list_nodes(expected, actual, DEBUG) is True
def test_middle_of_the_linked_list_1():
head = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))
expected = head.next.next
actual = middle_node(head)
assert compare_list_nodes(expected, actual, DEBUG) is True
