forked from UNN/2026-rff_mp
92 lines
1.8 KiB
Python
92 lines
1.8 KiB
Python
head = None
|
|
|
|
#node1 = {'name' : 'Ivan', 'phone' : '123-456', 'next' : None}
|
|
#head = node1
|
|
|
|
#node2 = {'name' : 'Dima', 'phone' : '789-123', 'next' : None}
|
|
#node1['next'] = node2
|
|
|
|
def ll_insert(head, name, phone):
|
|
|
|
curent = head
|
|
while curent is not None:
|
|
if curent['name'] == name:
|
|
curent['phone'] = phone
|
|
return head
|
|
curent = curent['next']
|
|
|
|
|
|
n_node = {'name' : name, 'phone' : phone, 'next' : None}
|
|
|
|
if head is None:
|
|
return n_node
|
|
|
|
curent = head
|
|
while curent['next'] is not None:
|
|
curent = curent['next']
|
|
curent['next'] = n_node
|
|
return head
|
|
|
|
|
|
|
|
print("====== TESTING ll_insert FUNC ========")
|
|
head = ll_insert(head,'Ivan','123-456')
|
|
|
|
print(head)
|
|
|
|
head = ll_insert(head, 'Boris', '123-456')
|
|
|
|
print(head)
|
|
|
|
head = ll_insert(head, 'Ivan', '321-654')
|
|
|
|
print(head)
|
|
|
|
head = ll_insert(head, 'Dima', '345-678')
|
|
|
|
print(head)
|
|
|
|
head = ll_insert(head, 'Boris', '111-222')
|
|
|
|
print(head)
|
|
print(f"======= END TEST =======\n\n\n")
|
|
|
|
|
|
def ll_find(head, name):
|
|
curent = head
|
|
while curent is not None:
|
|
if curent['name'] == name:
|
|
return curent['phone']
|
|
curent = curent['next']
|
|
return None
|
|
|
|
print("====== TESTING ll_find FUNC ======")
|
|
|
|
print("Ivan`s phone: "+ ll_find(head, 'Ivan'))
|
|
|
|
print("Dima`s phone: "+ ll_find(head, 'Dima'))
|
|
|
|
print("Boris phone: "+ ll_find(head, 'Boris'))
|
|
|
|
print(f"====== END TEST ======\n\n\n")
|
|
|
|
|
|
def ll_delete(head, name):
|
|
if head is None:
|
|
return None
|
|
|
|
if head['name'] == name:
|
|
return head['next']
|
|
|
|
prev = head
|
|
curent = head['next']
|
|
while curent is not None:
|
|
if curent['name'] == name:
|
|
prev['next'] = curent['next']
|
|
return head
|
|
prev = curent
|
|
curent = curent['next']
|
|
return head
|
|
|
|
print("Del of Dima:", ll_delete(head, 'Dima'))
|