algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

circular_linked_list: Add more len() tests (#2051)

Browse Source 
* circular_linked_list: Add more len() tests

* fixup! Format Python code with psf/black push

* prepend()

* updating DIRECTORY.md

* Fix decrementation of self.length

* Add empty list tests

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2020-05-31 09:36:57 +02:00
committed by GitHub
parent 3357768fc3
commit 1e8fe8efcf
3 changed files with 37 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
data_structures/linked_list/circular_linked_list.py
View File

@@ -37,6 +37,15 @@ class CircularLinkedList:
>>> cll.append(1)
>>> len(cll)
1
>>> cll.prepend(0)
>>> len(cll)
2
>>> cll.delete_front()
>>> len(cll)
1
>>> cll.delete_rear()
>>> len(cll)
0
"""
return self.length
@@ -130,6 +139,9 @@ class CircularLinkedList:
>>> cll.delete_front()
>>> print(f"{len(cll)}: {cll}")
1: <Node data=2>
>>> cll.delete_front()
>>> print(f"{len(cll)}: {cll}")
0: Empty linked list
"""
if not self.head:
raise IndexError("Deleting from an empty list")
@@ -137,7 +149,7 @@ class CircularLinkedList:
current_node = self.head
if current_node.next_ptr == current_node:
self.head, self.length = None, 0
self.head = None
else:
while current_node.next_ptr != self.head:
current_node = current_node.next_ptr
@@ -146,6 +158,8 @@ class CircularLinkedList:
self.head = self.head.next_ptr
self.length -= 1
if not self.head:
assert self.length == 0
def delete_rear(self) -> None:
"""
@@ -162,6 +176,9 @@ class CircularLinkedList:
>>> cll.delete_rear()
>>> print(f"{len(cll)}: {cll}")
1: <Node data=1>
>>> cll.delete_rear()
>>> print(f"{len(cll)}: {cll}")
0: Empty linked list
"""
if not self.head:
raise IndexError("Deleting from an empty list")
@@ -169,7 +186,7 @@ class CircularLinkedList:
temp_node, current_node = self.head, self.head
if current_node.next_ptr == current_node:
self.head, self.length = None, 0
self.head = None
else:
while current_node.next_ptr != self.head:
temp_node = current_node
@@ -178,6 +195,8 @@ class CircularLinkedList:
temp_node.next_ptr = current_node.next_ptr
self.length -= 1
if not self.head:
assert self.length == 0
if __name__ == "__main__":