123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756 |
-
-
- def first_unique_char(s):
- s.lower()
- for i in range(len(s)):
- if s.count(s[i]) == 1:
- return i
- else:
- return -1
-
- def format_name_list(names: list):
- length = len(names)
- s = ""
- if length == 0:
- return ""
- elif length == 1:
- return names[0].get("name")
- elif length == 2:
- return names[0].get("name") + ' и ' + names[1].get("name")
- else:
- for i in range(len(names) - 1):
- s += names[i].get("name") + ', '
-
- return s[:-2] + " и " + names[-1].get("name")
-
- def get_domain_name(url : str):
- my_list = []
- if url.find("//") != -1:
- my_list = url.split("//")
- if my_list[1].find("www") != -1:
- my_list = my_list[1].split(".")
- return my_list[1]
-
- else:
- my_list = my_list[1].split(".")
- return my_list[0]
- else:
- my_list = url.split(".")
- return my_list[1]
- def factorial(n):
- fact = 1
- for num in range(2, n + 1):
- fact *= num
- return fact
- def trailing_zeros(n):
- s = str(factorial(n))[::-1]
- l = []
- for i in range(len(s)):
- if s[i] != '0':
- break
- else:
- l.append(s[i])
- return len(l)
- def count_AGTC(dna):
- return dna.count('A'), dna.count('G'), dna.count('T'), dna.count('C')
- def foo():
- "Эта функция делает что-то"
- pass
- class Model:
- """
- This is class model
- """
- pass
- def get_even(lst, number):
- """_summary_
- Args:
- lst (_type_): _description_
- number (_type_): _description_
- """
- from typing import List, Dict, Tuple, Optional, Any, Union
- def list_upper(lst: List[str]):
- for elem in lst:
- print(elem.upper())
- def first_repeated_word(s: str):
- """Находит первый дубль в строке
- Args:
- s (str): строка
- Returns:
- str: первое повторяющееся слово
- """
- l = s.split()
- d_index = dict()
- for i in range(len(l)):
- if (l.count(l[i]) > 1) and l[i] not in d_index.values():
- d_index.update({l.index(l[i], i+1, len(l)) : l[i]})
-
- if len(d_index) == 0:
- return None
- m = len(l)
- if m == 0:
- return None
- for key,value in d_index.items():
- if key < m:
- m = key
- return d_index.get(m)
-
- def shift_letter(sim: str, shift: int):
- """Функция сдвигает символ letter на shift позиций """
- code = ord(sim) - 97
- if shift >= 0:
- shift = shift - 26*(shift//26)
- if (code + 97 + shift) >= 122:
- return chr(code + 97 + shift - 26)
- else:
- return chr(code + 97 + shift)
- else:
- shift *= -1
- shift = shift - 26*(shift//26)
- if (code + 97 - shift) < 97:
- return chr(code + 97 + 26 - shift)
- else:
- return chr(code + 97 - shift)
- def caesar_cipher(message: str, shift: int):
- """Шифр цезаря"""
- my_str = ""
- for i in message:
- if i.isalpha():
- my_str += shift_letter(i, shift)
- else :
- my_str += i
- return my_str
- MIN_DRIVING_AGE = 18
- def allowed_driving(name: str, age: int) -> None:
- global MIN_DRIVING_AGE
- if (age >= MIN_DRIVING_AGE):
- print(name, "может водить")
- else:
- print(name, "еще рано садиться за руль")
- def get_word_indices(strings: list) -> dict:
- l = []
- d = {}
- for i in strings:
- l.append(i.lower().split())
- for i in range(len(l)):
- for j in l[i]:
- if j not in d.keys():
- d.setdefault(j, [i])
- else:
- short_list = d.get(j)
- short_list.append(i)
- d.update({j: short_list})
- return d
-
-
- def foo(a: int, b: int) -> int:
- return a + b
- def replace(text: str, old: str, new: str = ''):
- s = ''
- for i in text:
- if i == old:
- s += new
- else:
- s += i
- return s
- def make_header(header: str, h_size : int = 1):
- return "<h" + str(h_size) + ">" + header + "</h" + str(h_size) + ">"
-
- def append_to_list(value, my_list = None):
- if my_list is None:
- my_list = []
- my_list.append(value)
- print(my_list, id(my_list))
- def create_matrix(size : int = 3, up_fill : int = 0, down_fill : int = 0):
- l = [[i if i == j else 0 for j in range(1, size + 1) ] for i in range(1, size + 1)]
-
- for i in range(0, size):
- for j in range(0, size):
- if j > i:
- l[i][j] = up_fill
- elif j < i:
- l[i][j] = down_fill
- return l
- def f(a, b, c, d):
- print(a, b, c, d)
- def only_one_positive(*args):
- cnt = 0
- for i in args:
- if i >= 0:
- cnt += 1
- return cnt == 1
- def print_goods(*args):
- cnt = 1
- for i in args:
- if type(i) == str and len(i) > 0:
- print(cnt, ". ", i, sep='')
- cnt += 1
- if cnt == 1:
- print("Нет товаров")
- def info_kwargs(**kwargs):
- for k, v in sorted(kwargs.items()):
- print(f'{k} = {v}')
- def f(*args, **kwargs):
- print(args, kwargs)
- def create_actor(**kwargs):
- d = {'name': 'Райан',
- 'surname': 'Рейнольдс',
- 'age': 46}
- d.update(kwargs)
- return d
- def fact(x):
- if x == 1:
- return 1
- return fact(x-1)*x
- def palindrom(s):
- if len(s) <= 1:
- return True
- if s[0] != s[-1]:
- return False
- return palindrom(s[1:-1])
- def print_from(n: int):
- if n == 0:
- return
- print(n)
- return print_from(n - 1)
- def print_to(n: int):
- if n < 1:
- return
- print_to(n - 1)
- print(n)
- def req(l : list) -> None:
- if len(l) == 0:
- return
- req(l[1:])
- print(l[0], end=' ')
- def double_fact(n : int) -> int:
- if n == 1:
- return 1
- elif n == 2:
- return 2
- return n*double_fact(n - 2)
- def fib(n : int) -> int:
- if n == 0:
- return 0
- elif n == 1:
- return 1
- return fib(n - 1) + fib(n - 2)
- def tribonacci(n : int) -> int:
- if n == 0 or n == 1:
- return 0
- elif n == 2:
- return 1
- return tribonacci(n - 1) + tribonacci(n - 2) + tribonacci(n - 3)
- def get_combin(n, k):
- if k == 0 or k == n:
- return 1
- return(get_combin(n - 1, k) + get_combin(n - 1, k - 1))
- def ackermann(m, n):
- if m == 0:
- return n + 1
- if m > 0 and n == 0:
- return ackermann(m - 1, 1)
- return ackermann(m - 1, ackermann(m, n - 1))
- def list_sum_recursive(l : list) -> int:
- if len(l) == 0:
- return 0
- elif len(l) == 1 :
- return l[0]
- return l.pop() + list_sum_recursive(l)
- def flatten(l : list) -> list:
- if not l :
- return []
- if isinstance(l[0], list):
- return flatten(l[0]) + flatten(l[1:])
- return l[:1] + flatten(l[1:])
- def st(s : str) -> str:
- if len(s) == 1 or len(s) == 2:
- return s
- return s[0] + '(' + st(s[1:-1]) + ')' + s[-1]
- def power(x, n):
- if n == 0:
- return 1
- if n < 0:
- return 1/power(x, -n)
- if n%2 == 0:
- return power(x, n//2)*power(x, n//2)
- else :
- return power(x, n - 1)*x
- a = [1, 2,[2, 3, 4, [3, 4,[2, 3], 5]]]
- def rec(l, level=1):
- print(l, 'level = ', level)
- for i in l:
- if type(i) == list:
- rec(i, level + 1)
- def flatten_dict(nested : dict, prefix : str = '') -> dict:
- result = dict()
- for key, value in nested.items():
- if type(value) == int:
- result.update({prefix + key: value})
- else:
- result.update(flatten_dict(value, prefix + key + '_'))
- return result
-
- nes = {'Germany': {'berlin': 7},
- 'Europe': {'italy': {'Rome': 3}},
- 'USA': {'washington': 1, 'New York': 4}}
- def merge_two_list(a, b):
- c = []
- i = j = 0
- while i < len(a) and j < len(b):
- if a[i] < b[j]:
- c.append(a[i])
- i += 1
- else:
- c.append(b[j])
- j += 1
- if i < len(a):
- c += a[i:]
- elif j < len(b):
- c += b[j:]
- return c
- def merge_sort(s):
- if len(s) == 1:
- return s
- middle = len(s)//2
- left = merge_sort(s[:middle])
- right = merge_sort(s[middle:])
- return merge_two_list(left, right)
- def quick_sort(s):
- if len(s) <= 1:
- return s
-
- elem = s[0]
- left = list(filter(lambda x: x < elem, s))
- center = [i for i in s if i == elem]
- right = list(filter(lambda x: x > elem, s))
- return quick_sort(left) + center + quick_sort(right)
- def get_days(month):
- if month in (1, 3, 5, 7, 8, 10, 12):
- print(31)
- elif month == 2:
- print(28)
- else:
- print(30)
-
|