MCPcopy Create free account
hub / github.com/TheAlgorithms/Python / append

Method append

data_structures/linked_list/reverse_k_group.py:54–74  ·  view source on GitHub ↗

>>> ll = LinkedList([1, 2]) >>> tuple(ll) (1, 2) >>> ll.append(3) >>> tuple(ll) (1, 2, 3) >>> ll.append(4) >>> tuple(ll) (1, 2, 3, 4) >>> len(ll) 4

(self, data: int)

Source from the content-addressed store, hash-verified

52 return " -> ".join([str(node) for node in self])
53
54 def append(self, data: int) -> None:
55 """
56 >>> ll = LinkedList([1, 2])
57 >>> tuple(ll)
58 (1, 2)
59 >>> ll.append(3)
60 >>> tuple(ll)
61 (1, 2, 3)
62 >>> ll.append(4)
63 >>> tuple(ll)
64 (1, 2, 3, 4)
65 >>> len(ll)
66 4
67 """
68 if not self.head:
69 self.head = Node(data)
70 return
71 node = self.head
72 while node.next_node:
73 node = node.next_node
74 node.next_node = Node(data)
75
76 def reverse_k_nodes(self, group_size: int) -> None:
77 """

Callers 1

__init__Method · 0.95

Calls 1

NodeClass · 0.70

Tested by

no test coverage detected