-
写一个匿名函数,判断指定的年是否是闰年 (先直接用普通函数)
# 方法1 year1 = lambda x: (x % 4 == 0 and x % 100 != 0) or x % 400 == 0 print(year1(2024)) # 方法2 def year2(year): if (year % 4 == 0 and year % 100 != 0) or year % 400 == 0: return True return False print(year2(2008))
-
写一个函数将一个指定的列表中的元素逆序( 如[1, 2, 3] -> [3, 2, 1])(注意:不要使用列表自带的逆序函数)
# 方法1
def reverse_list(list1:list):
return list1[::-1]
nums = [12,4,98,67]
print(reverse_list(nums))
#方法2
def reverse_list1(list1:list):
count = len(list1)
for n in range(count//2):
m = count - 1 - n
list1[n],list1[m] = list1[m],list1[n]
nums = [12,4,98,67]
reverse_list1(nums)
print(nums)
# 方法3
nums = [12,4,98,67]
result = map(lambda x:nums[len(nums)-1-x],range(len(nums)))
print(list(result))
- 编写一个函数,计算一个整数的各位数的平方和
例如: sum1(12) -> 5(1的平方加上2的平方) sum1(123) -> 14
# 方法1
from functools import reduce
nums = 12
print(reduce(lambda x, y: x + int(y) ** 2, list(str(nums)), 0))
# 方法2
def sum1(x:int):
a = []
for i in range(len(str(x))):
b = x%10
a.append(b**2)
x = x//10
return sum(a)
print(sum1(1234))
- 求列表 nums 中绝对值最小的元素
例如:nums = [-23, 100, 89, -56, -234, 123], 最小值是:-23
# 方法1
print(min(nums,key=lambda x:x**2))
# 方法2
def num_min(nums_list:list):
a = nums_list.copy()
for i in range(len(a)):
if a[i] < 0:
a[i] = -a[i]
for j in nums_list:
if min(a) == j or -min(a) == j:
return j
print(num_min([-23, 100, 89, -56, -234, 123]))
-
已经两个列表A和B,用map函数创建一个字典,A中的元素是key,B中的元素是value
A = ['name', 'age', 'sex'] B = ['张三', 18, '女'] 新字典: {'name': '张三', 'age': 18, 'sex': '女'} result = map(lambda x,y:(x,y),A,B) print(dict(result))
-
已经三个列表分别表示5个学生的姓名、学科和班号,使用map将这个三个列表拼成一个表示每个学生班级信息的的字典
names = ['小明', '小花', '小红', '老王'] nums = ['1906', '1807', '2001', '2004'] subjects = ['python', 'h5', 'java', 'python'] 结果:{'小明': 'python1906', '小花': 'h51807', '小红': 'java2001', '老王': 'python2004'} result = map(lambda x,y,z:(x,z+y),names,nums,subjects) print(dict(result))
-
已经一个列表message, 使用reduce计算列表中所有数字的和
message = ['你好', 20, '30', 5, 6.89, 'hello']
结果:31.89
from functools import reduce
print(reduce(lambda x, y: x + y, filter(lambda x: type(x) in (int,float), message), 0))
# 31.89
-
已经列表points中保存的是每个点的坐标(坐标是用元组表示的,第一个值是x坐标,第二个值是y坐标)
points = [ (10, 20), (0, 100), (20, 30), (-10, 20), (30, -100) ]
1)获取列表中y坐标最大的点
# 方法1 def max_p(points): a = [] for i in range(len(points)): a.append(points[i][1]) return max(a) print(max_p(points)) # 方法2 print(max(points,key=lambda x:x[1]))
2)获取列表中x坐标最小的点
# 方法1 def min_p(points): a = [] for i in range(len(points)): a.append(points[i][0]) return min(a) print(min_p(points)) # 方法2 print(min(points,key=lambda x:x[0]))
3)获取列表中距离原点最远的点
points = [(10, 20), (0, 100), (20, 30), (-10, 20), (30, -100)] print(max(points,key=lambda x:(x[0]**2+x[1]**2)**0.5))
4)将点按照点到x轴的距离大小从大到小排序
points = [(10, 20), (0, 100), (20, 30), (-10, 20), (30, -100)] print(sorted(points, key=lambda x: x[1] if x[1]>0 else -x[1],reverse=True))
10.封装一个函数完成斗地主发牌的功能。
import random # 生成牌 def get_card(card=[]): """ :param card:一副牌 :return: 返回一副打乱的牌 """ color = ["♠","♣","♦","♥"] for j in range(len(color)): for i in range(1, 14): if i == 1: i = "A" elif i == 11: i = "J" elif i == 12: i = "Q" elif i == 13: i = "K" card.append(color[j] + str(i)) # 添加大小王 card.append("大王") card.append("小王") for i in range(4): random.shuffle(card) return card print(get_card()) # 发牌 def put_card(player1=[],player2=[],landboss=[]): """ :param landboss: 地主牌 :param player1: 一号农民牌 :param player2: 二号农民牌 :return: 返回三位玩家的牌 """ i = 0 while i < 51: player1.append(get_card()[i]) player2.append(get_card()[i + 1]) landboss.append(get_card()[i + 2]) i += 3 landboss += get_card()[51:54] return landboss,player1,player2 print(put_card())