mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-16 18:57:37 +00:00
Code Issues Packages Projects Releases Wiki Activity

"Added type hints for variables in SortedLinkedList class"

Browse Source
This commit is contained in:
mjk22071998 2024-10-01 15:41:31 +05:00
parent 3d9263b279
commit 2389245669
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
data_structures/linked_list/sorted_linked_list.py
View File

@ -65,7 +65,7 @@ class SortedLinkedList:
'SortedLinkedList(2, 12, 21, 23, 72)' 'SortedLinkedList(2, 12, 21, 23, 72)'
""" """
nodes = [] nodes = []
temp = self.head temp: Optional[Node] = self.head
while temp: while temp:
nodes.append(str(temp.data)) nodes.append(str(temp.data))
temp = temp.next_node temp = temp.next_node
@ -95,7 +95,7 @@ class SortedLinkedList:
new_node.next_node = self.head new_node.next_node = self.head
self.head = new_node self.head = new_node
else: else:
temp_node = self.head temp_node: Optional[Node] = self.head
while temp_node.next_node and temp_node.next_node.data < data: while temp_node.next_node and temp_node.next_node.data < data:
temp_node = temp_node.next_node temp_node = temp_node.next_node
new_node.next_node = temp_node.next_node new_node.next_node = temp_node.next_node
@ -117,7 +117,7 @@ class SortedLinkedList:
>>> linkedList.display() >>> linkedList.display()
32 45 57 32 45 57
""" """
temp = self.head temp: Optional[Node] = self.head
while temp: while temp:
print(temp.data, end=" ") print(temp.data, end=" ")
temp = temp.next_node temp = temp.next_node
@ -158,7 +158,7 @@ class SortedLinkedList:
self.tail = None self.tail = None
return True return True
temp_node = self.head temp_node: Optional[Node] = self.head
while temp_node.next_node: while temp_node.next_node:
if temp_node.next_node.data == data: if temp_node.next_node.data == data:
temp_node.next_node = temp_node.next_node.next_node temp_node.next_node = temp_node.next_node.next_node
@ -189,7 +189,7 @@ class SortedLinkedList:
>>> linkedList.search(90) >>> linkedList.search(90)
False False
""" """
temp = self.head temp: Optional[Node] = self.head
while temp: while temp:
if temp.data == data: if temp.data == data:
return True return True
@ -302,7 +302,7 @@ class SortedLinkedList:
32 45 57 32 45 57
""" """
temp = self.head temp: Optional[Node] = self.head
while temp and temp.next_node: while temp and temp.next_node:
if temp.data == temp.next_node.data: if temp.data == temp.next_node.data:
temp.next_node = temp.next_node.next_node temp.next_node = temp.next_node.next_node
@ -336,7 +336,7 @@ class SortedLinkedList:
self.tail = other_list.tail self.tail = other_list.tail
return return
else: else:
temp=other_list.head temp: Optional[Node]=other_list.head
while temp: while temp:
self.insert(temp.data) self.insert(temp.data)
temp = temp.next_node temp = temp.next_node