def test_LinkedList_append_empty_list(): ll = LinkedList() ll.insert("1", "3", "2") ll.append("5") actual = str(ll) expected = "{2} -> {3} -> {1} -> {5} -> NULL" assert actual == expected
def to_ll(num): new_ll = LinkedList() for n in str(num): new_ll.append(int(n)) return new_ll
def test_LinkedList_append_empty_list(): ll = LinkedList() ll.append("5") actual = str(ll) expected = "{5} -> NULL" assert actual == expected
longer = adjust_longer(longer, diff) #traverse through the linked lists to find the intersection current_s, current_l = shorter.head, longer.head while current_s: if current_s.value == current_l.value: return current_s current_s, current_l = current_s.next, current_l.next return "no intersection" if __name__ == "__main__": ll_1 = LinkedList() ll_2 = LinkedList() # ll = LinkedList() # ll.insert("A", "B", "C", "C", "B", "D") # print(ll) # ll.insert("C", "E", "A", "E", "D", "C", "A", "C", "A") # print(delete_middle(ll)) # ll.insert(1, 2, 8, 3, 5, -1,200) # print("this is the ll", ll) # print(partition(ll, 3)) ll_1.append(1, 2, 3, 11) ll_2.append(5, 25, 45, 22, 3, 11) print("One", ll_1, "Two", ll_2) # # print(sum_lists(ll_1, ll_2)) # print(sum_lists2(ll_1, ll_2)) # print(new_sum_ll(ll_1, ll_2)) print(find_intersection2(ll_1, ll_2))