41 lines
1.1 KiB
Python
41 lines
1.1 KiB
Python
def ll_insert(head, name, phone):
|
|
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': head}
|
|
return new_node
|
|
|
|
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['naext']['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['phine']))
|
|
current = current['next']
|
|
records.sort(key=lambda x: x[0])
|
|
return records
|