сделал явную сортировку и исправил недочеты

This commit is contained in:
volkovva 2026-05-23 16:12:52 +03:00
parent 60b42ee51c
commit f589771843

View File

@ -12,11 +12,12 @@ def ll_insert(head, name, phone):
if current['name'] == name:
current['phone'] = phone
return head
if current['next'] is None:
break
current = current['next']
new_node['next'] = head
return new_node
current['next'] = new_node
return head
def ll_find(head, name):
current = head
@ -36,21 +37,26 @@ def ll_delete(head, name):
current = head
while current['next'] is not None:
if current['next']['name'] == name:
current['next']==current['next']['next']
current['next'] = current['next']['next']
return head
current = current['next']
return head
def sort_records(lst):
n = len(lst)
for i in range(n):
for j in range(0, n-i-1):
if lst[j][0] > lst[j + 1][0]:
lst[j], lst[j + 1] = lst[j + 1], lst[j]
return lst
def ll_list_all(head):
record = []
current = head
while current is not None:
record.append(current['name'], current['phone'])
record += [(current['name'], current['phone'])]
current = current['next']
record.sort(key=lambda x: x[0])
return record
res = sort_records(record)
return res