def test_insert_extreme_values(a):
    with pytest.raises(IndexError):
        lnkd_lst = LinkedList()
        lnkd_lst.append('Hello')
        lnkd_lst.append('World')
        lnkd_lst.append('!')
        lnkd_lst.append('Today')
        lnkd_lst.append('I')
        lnkd_lst.append('will')
        lnkd_lst.append('conquer')
        lnkd_lst.append('you')
        lnkd_lst.append('!')
        lnkd_lst.insert(5, a)
Exemplo n.º 2
0
def main():
    llist = LinkedList()
    llist.push(7)
    llist.push(1)
    llist.push(3)
    llist.push(2)
    llist.push(8)
    llist.append(10)
    llist.insert(llist.get_head().get_next(), 5)

    llist.print_list()
    print("Reversing a list")
    reverse(llist)
    llist.print_list()

    print("Reversing a list again using recursion")
    reverse_rec(llist)
    llist.print_list()
def main():
    llist = LinkedList()
    llist.push(7)
    llist.push(1)
    llist.push(3)
    llist.push(2)
    llist.push(8)
    llist.append(10)
    llist.insert(llist.get_head().get_next(), 5)

    llist.print_list()

    print(find_middle(llist))

    llist.delete_node(2)
    llist.print_list()

    print(find_middle(llist))
def add_num_linkedlist(node1, node2):
    if node1 is None and node2 is None:
        return None
    else:
        carry = 0
        newlist = LinkedList()
        while node1 is not None or node2 is not None:
            addition = 0
            addition += carry
            if node1 is not None:
                addition += node1.data
                node1 = node1.next
            if node2 is not None:
                addition += node2.data
                node2 = node2.next
            digit = addition % 10
            if addition >= 10:
                carry = 1
            else:
                carry = 0
            newlist.insert(digit)
            digit = 0
        return newlist
    def test_insert(self):

        node_1000 = Node(1000)
        list_test = LinkedList()
        list_test.insert(None, node_1000)
        self.assertEqual(get_list_nodes(list_test), [1000])

        list_test = LinkedList()
        node_12 = Node(12)
        list_test.add_in_tail(node_12)
        list_test.insert(node_12, node_1000)
        self.assertEqual(get_list_nodes(list_test), [12, 1000])

        list_test = LinkedList()
        node_12 = Node(12)
        node_73 = Node(73)
        list_test.add_in_tail(node_12)
        list_test.add_in_tail(node_73)
        list_test.insert(node_12, node_1000)
        self.assertEqual(get_list_nodes(list_test), [12, 1000, 73])
def test_insert(lst):
    lnkd_lst = LinkedList()
    for i in lst:
        lnkd_lst.insert(i, 0)
    for i in range(len(lst) - 1, 0, -1):
        assert lst[::-1][i] == lnkd_lst.get(i).value