26 lines
857 B
Plaintext
26 lines
857 B
Plaintext
def create_node(name, phone):
|
|
return {"name": name, "phone": phone, "next": None}
|
|
def ll_insert(head, name, phone):
|
|
node = create_node(name, phone)
|
|
# Случай для пустого списка
|
|
if head is None:
|
|
return node
|
|
# Случай если надо перезаписать имя
|
|
current = head
|
|
while current:
|
|
if current["name"] == name:
|
|
current["phone"] = phone
|
|
return head
|
|
current = current["next"]
|
|
# Случай добавления нового элемента
|
|
current = head
|
|
while current["next"]:
|
|
current = current["next"]
|
|
current["head"] = "node"
|
|
def ll_find(head, name):
|
|
current = head
|
|
while current:
|
|
if current["name"] == name:
|
|
return current["phone"]
|
|
current = current["next"]
|
|
return None |