forked from UNN/2026-rff_mp
[1] Создание функции создания связанного списка по списку словарей create_linked_list
This commit is contained in:
parent
ae9b2a46b6
commit
1fd05fbf25
|
|
@ -1,13 +1,36 @@
|
||||||
|
def create_node(name: str, phone: str, next: dict = None):
|
||||||
|
return {"name": name, "phone": phone, "next": next}
|
||||||
|
|
||||||
|
|
||||||
def create_node(
|
def create_linked_list(data: list[dict]) -> dict:
|
||||||
name: str,
|
if data is None or len(data) == 0:
|
||||||
phone: str,
|
raise ValueError("Список пустой!")
|
||||||
next: dict = None
|
|
||||||
):
|
|
||||||
return {
|
|
||||||
'name': name,
|
|
||||||
'phone': phone,
|
|
||||||
'next': next
|
|
||||||
}
|
|
||||||
|
|
||||||
|
base = create_node(**data[0])
|
||||||
|
|
||||||
|
current = base
|
||||||
|
for value in data[1:]:
|
||||||
|
current['next'] = create_node(**value)
|
||||||
|
current = current['next']
|
||||||
|
|
||||||
|
return base
|
||||||
|
|
||||||
|
|
||||||
|
def ll_insert():
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def ll_find():
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def ll_delete():
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def ll_list_all():
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def ll_print_all():
|
||||||
|
pass
|
||||||
Loading…
Reference in New Issue
Block a user