mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
9c6080a6fc
* Adding __str__() function * Removing white space * Update data_structures/linked_list/__init__.py Co-authored-by: xcodz-dot <71920621+xcodz-dot@users.noreply.github.com> * Adding type hints * Update __init__.py * Update __init__.py * Adding the changes requested * Updating to fix pre-commit * Updating __init__.py * Updating __init__.py Co-authored-by: xcodz-dot <71920621+xcodz-dot@users.noreply.github.com>
81 lines
1.9 KiB
Python
81 lines
1.9 KiB
Python
"""
|
|
Linked Lists consists of Nodes.
|
|
Nodes contain data and also may link to other nodes:
|
|
- Head Node: First node, the address of the
|
|
head node gives us access of the complete list
|
|
- Last node: points to null
|
|
"""
|
|
|
|
from typing import Any
|
|
|
|
|
|
class Node:
|
|
def __init__(self, item: Any, next: Any) -> None:
|
|
self.item = item
|
|
self.next = next
|
|
|
|
|
|
class LinkedList:
|
|
def __init__(self) -> None:
|
|
self.head = None
|
|
self.size = 0
|
|
|
|
def add(self, item: Any) -> None:
|
|
self.head = Node(item, self.head)
|
|
self.size += 1
|
|
|
|
def remove(self) -> Any:
|
|
if self.is_empty():
|
|
return None
|
|
else:
|
|
item = self.head.item
|
|
self.head = self.head.next
|
|
self.size -= 1
|
|
return item
|
|
|
|
def is_empty(self) -> bool:
|
|
return self.head is None
|
|
|
|
def __str__(self) -> str:
|
|
"""
|
|
>>> linked_list = LinkedList()
|
|
>>> linked_list.add(23)
|
|
>>> linked_list.add(14)
|
|
>>> linked_list.add(9)
|
|
>>> print(linked_list)
|
|
9 --> 14 --> 23
|
|
"""
|
|
if not self.is_empty:
|
|
return ""
|
|
else:
|
|
iterate = self.head
|
|
item_str = ""
|
|
item_list = []
|
|
while iterate:
|
|
item_list.append(str(iterate.item))
|
|
iterate = iterate.next
|
|
|
|
item_str = " --> ".join(item_list)
|
|
|
|
return item_str
|
|
|
|
def __len__(self) -> int:
|
|
"""
|
|
>>> linked_list = LinkedList()
|
|
>>> len(linked_list)
|
|
0
|
|
>>> linked_list.add("a")
|
|
>>> len(linked_list)
|
|
1
|
|
>>> linked_list.add("b")
|
|
>>> len(linked_list)
|
|
2
|
|
>>> _ = linked_list.remove()
|
|
>>> len(linked_list)
|
|
1
|
|
>>> _ = linked_list.remove()
|
|
>>> len(linked_list)
|
|
0
|
|
"""
|
|
return self.size
|