mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-17 03:07:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-01 11:33:12 +00:00
parent 00086389ad
commit b7fef5c169
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
data_structures/linked_list/sorted_linked_list.py
View File

@ -113,7 +113,7 @@ class SortedLinkedList:
>>> linkedList.insert(57) >>> linkedList.insert(57)
>>> linkedList.insert(45) >>> linkedList.insert(45)
>>> linkedList.display() >>> linkedList.display()
32 45 57 32 45 57
""" """
temp: Node | None = self.head temp: Node | None = self.head
while temp: while temp:
@ -141,11 +141,11 @@ class SortedLinkedList:
>>> linkedList.insert(57) >>> linkedList.insert(57)
>>> linkedList.insert(45) >>> linkedList.insert(45)
>>> linkedList.display() >>> linkedList.display()
32 45 57 32 45 57
>>> linkedList.delete(45) >>> linkedList.delete(45)
True True
>>> linkedList.display() >>> linkedList.display()
32 57 32 57
""" """
if self.head is None: if self.head is None:
return False return False
@ -166,7 +166,7 @@ class SortedLinkedList:
self.num_nodes -= 1 self.num_nodes -= 1
return True return True
temp_node = temp_node.next_node temp_node = temp_node.next_node
return False return False
def search(self, data: int) -> bool: def search(self, data: int) -> bool:
@ -295,10 +295,10 @@ class SortedLinkedList:
>>> linkedList.insert(45) >>> linkedList.insert(45)
>>> linkedList.insert(45) >>> linkedList.insert(45)
>>> linkedList.display() >>> linkedList.display()
32 45 45 57 32 45 45 57
>>> linkedList.remove_duplicates() >>> linkedList.remove_duplicates()
>>> linkedList.display() >>> linkedList.display()
32 45 57 32 45 57
""" """
temp: Node | None = self.head temp: Node | None = self.head