from math import floordef difference_by(a,b,fn):b = set(map(fn, b))return [i for i in a if fn(i) not in b]
print(difference_by([2.1, 1.2], [2.3, 3.4], floor))
def add(a, b):return a + b
def subtract(a ,b):return a - b
a, b = 4, 5
print((subtract if a>b else add)(a, b))
def has_duplicate(lst):return len(lst) != len(set(lst))
x = ['公共开发', '实验室', 'python']
y = ['公共开发', '实验室', 'python', 'python']
def merge_dictionaries(a, b):return {**a, **b}
a = {'x': 1, 'y': 2}
b = {'y': 3, 'z': 4}
print(merge_dictionaries(a, b))
def to_dictionary(keys, values):return dict(zip(keys, values))
keys = ['a', 'b', 'c']
values = [2 , 3, 4]
print(to_dictionary(keys, values))
lst = ['a', 'b', 'c', 'd']
for index,value in enumerate(lst):print('value', value, 'index', index)
import time
start_time = time.time()
a = 2023
b = 2022
c = a - b
print(c)
end_time = time.time()
total_time = end_time - start_time
print('Time:', total_time)
try:print(int('你'))
except:print('有异常发生,请检查:int没法直接强制转换字符"你"')
else:print('try成功才会执行此处')
def most_frequent(lst2):return max(lst2, key=lst2.count)
lst1 = ['Python', 'Python', '公共开发', '公共开发', '公共开发', '12345678']
print(most_frequent(lst1)) # 公共开发
def most_max_length(lst2):return max(lst2, key=len)
lst1 = ['Python', 'Python', '公共开发', '公共开发', '公共开发', '12345678']
print(most_max_length(lst1)) # 公共开发
def change_int(lst):lst2 = list(map(str, lst))return lst2
lst = [1,2,3,4,5,6]
print(change_int(lst)) # ['1', '2', '3', '4', '5', '6']
from re import sub
def palindrome(string):s = sub('[\W_]', '', string.lower()) # 中括号内\W_表示用于匹配\W或者_print(s)return s == s[::-1]
print(palindrome('ta co cat'))
d = {'a': 1, 'b': 2}
print(d.get('c', 3))
上一篇:【CPP】定义一个类