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

Errors from ruff tests solved

Browse Source
This commit is contained in:
mjk22071998 2024-10-01 13:25:32 +05:00
parent 01dfb178b2
commit 187f4da98a
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
data_structures/linked_list/sorted_linked_list.py
View File

@ -18,7 +18,7 @@ class Node:
return f"Node({self.data}, {self.next_node})"
class SortedLinedList:
class SortedLinkedList:
def __init__(self):
self.numNodes: int = 0
self.head: Node | None = None
@ -130,7 +130,7 @@ class SortedLinedList:
Returns:
int: The length of linked list
"""
return numNodes
return self.numNodes
def min_value(self) -> int | None:
"""This function will return minimum value
@ -190,7 +190,7 @@ class SortedLinedList:
if __name__ == "__main__":
linkedList = SortedLinedList()
linked_list = SortedLinedList()
while True:
print("Enter")
print("1. Insert")
@ -201,9 +201,9 @@ if __name__ == "__main__":
if choice == "1":
data = int(input("Enter a number: "))
linkedList.insert(data)
linked_list.insert(data)
elif choice == "2":
linkedList.display()
linked_list.display()
elif choice == "3":
data = int(input("Enter the data to delete: "))
if linked_list.delete(data):