mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-28 16:43:38 +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 10:49:39 +00:00
parent 3ab0f7e585
commit 5d98fd74dc
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

@ -116,7 +116,7 @@ class SortedLinkedList:
>>> linkedList.insert(57)
>>> linkedList.insert(45)
>>> linkedList.display()
32 45 57
32 45 57
"""
temp: Optional[Node] = self.head
while temp:
@ -144,11 +144,11 @@ class SortedLinkedList:
>>> linkedList.insert(57)
>>> linkedList.insert(45)
>>> linkedList.display()
32 45 57
32 45 57
>>> linkedList.delete(45)
True
>>> linkedList.display()
32 57
32 57
"""
if self.head is None:
return False
@ -296,10 +296,10 @@ class SortedLinkedList:
>>> linkedList.insert(45)
>>> linkedList.insert(45)
>>> linkedList.display()
32 45 45 57
32 45 45 57
>>> linkedList.remove_duplicates()
>>> linkedList.display()
32 45 57
32 45 57
"""
temp: Optional[Node] = self.head
@ -327,7 +327,7 @@ class SortedLinkedList:
>>> linkedList2.insert(95)
>>> linkedList.merge(linkedList2)
>>> linkedList.display()
23 32 45 47 57 95
23 32 45 47 57 95
"""
if other_list.head is None:
return