diff --git a/ivanchenkoam/laba1.txt b/ivanchenkoam/laba1.txt index 2b5ab87..b04fdb5 100644 --- a/ivanchenkoam/laba1.txt +++ b/ivanchenkoam/laba1.txt @@ -5,4 +5,65 @@ import sys from typing import List, Tuple, Optional, Any, Dict #лимит рекурсии -sys.setrecursionlimit(20000) \ No newline at end of file +sys.setrecursionlimit(20000) +def ll_insert(head: Optional[Dict], name: str, phone: str) -> Dict: + """Вставка в конец связного списка""" + new_node = {'name': name, 'phone': phone, 'next': None} + + if head is None: + return new_node + + current = head + while current['next'] is not None: + # Обновляем, если уже есть + if current['name'] == name: + current['phone'] = phone + return head + current = current['next'] + + if current['name'] == name: + current['phone'] = phone + else: + current['next'] = new_node + + return head + + +def ll_find(head: Optional[Dict], name: str) -> Optional[str]: + """Поиск в связном списке""" + current = head + while current is not None: + if current['name'] == name: + return current['phone'] + current = current['next'] + return None + + +def ll_delete(head: Optional[Dict], name: str) -> Optional[Dict]: + """Удаление из связного списка""" + 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: Optional[Dict]) -> List[Tuple[str, str]]: + """Сбор всех записей из связного списка с сортировкой""" + 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 \ No newline at end of file