forked from UNN/2026-rff_mp
47 lines
1.5 KiB
Python
47 lines
1.5 KiB
Python
def ll_insert(head, name, phone): #Oбновление записи в связном списке
|
||
if head is None:
|
||
return {'name': name, 'phone': phone, 'next': None}
|
||
current = head
|
||
while current is not None:
|
||
if current['name'] == name:
|
||
current['phone'] = phone
|
||
return head
|
||
current = current['next']
|
||
new_node = {'name': name, 'phone': phone, 'next': None}
|
||
current = head
|
||
while current['next'] is not None:
|
||
current = current['next']
|
||
current['next'] = new_node
|
||
return head
|
||
|
||
def ll_find(head, name): #Поиск телефона по имени
|
||
current = head
|
||
while current is not None:
|
||
if current['name'] == name:
|
||
return current['phone']
|
||
current = current['next']
|
||
return None
|
||
|
||
def ll_delete(head, name): #Удаление записи по имени
|
||
if head is None:
|
||
return None
|
||
|
||
if head['name'] == name:
|
||
return head['next']
|
||
|
||
current = head
|
||
while current['next'] is not None:
|
||
if current['next']['name'] == name:
|
||
current['next'] = current['next']['next']
|
||
return head
|
||
current = current['next']
|
||
return head
|
||
|
||
def ll_list_all(head): #Сбор всех записей и сортировка по имени
|
||
records = []
|
||
current = head
|
||
while current is not None:
|
||
records.append((current['name'], current['phone']))
|
||
current = current['next']
|
||
records.sort(key=lambda x: x[0])
|
||
return records |