-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrenwu3.py
113 lines (97 loc) · 2.46 KB
/
renwu3.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#!/usr/bin/python3
# encoding='utf-8'
# @time:2021/9/22 16:38
# 有下列人员数据库,请按要求实现
import math
names = [
["曹操", "56", "男", "106", "IBM", 500, "50"],
["大乔", "19", "女", "230", "微软", 501, "60"],
["小乔", "19", "女", "210", "Oracle", 600, "60"],
["许褚", "45", "男", "230", "Tencent", 700, "10"]
]
# 每个人的平均工资
arr = []
for i in names:
arr.append(i[0])
arr1 = set(arr)
for i in arr1:
k = 0
sum1 = 0
for j in names:
if j[0] == i:
k += 1
sum1 += j[5]
print(f'{i}的平均工资为{sum1 / k}')
# 每个人的平均年龄
arr = []
for i in names:
arr.append(i[0])
arr1 = set(arr)
for i in arr1:
k = 0
sum1 = 0
for j in names:
if j[0] == i:
k += 1
sum1 += int(j[1])
print(f'{i}的平均年龄为{sum1 / k}')
# 添加员工
names.append(['刘备', '45', '男', '220', 'alibaba', 500, '30'])
print(names)
# 统计公司男女数
arr = []
for i in names:
arr.append(i[4])
arr1 = set(arr)
for i in arr1:
male = 0
female = 0
for j in names:
if j[4] == i:
if j[2] == '男':
male += 1
elif j[2] == '女':
female += 1
print(f'{i}公司的男性有{male}人,女性有{female}人')
# 每个部门的人数
arr = []
for i in names:
arr.append(i[6])
arr1 = set(arr)
for i in arr1:
k = 0
for j in names:
if j[6] == i:
k += 1
print(f'{i}部门有{k}人')
# 现在魔法学院有赫敏、哈利、罗恩、马尔福四个人的几次魔法作业的成绩。但是呢,因为有些魔法作业有一定难度,教授不强制同学们必须上交,所以大家上交作业的次数并不一致。
# [罗恩, 23 ,35 ,44]
# [哈利 ,60, 77 ,68 ,88, 90]
# [赫敏, 97 ,99 ,89 ,91, 95, 90]
# [马尔福 ,100, 85 ,90]
# 求每个人的总成绩?
grade = [
['罗恩', 23, 35, 44],
['哈利', 60, 77, 68, 88, 90],
['赫敏', 97, 99, 89, 91, 95, 90],
['马尔福', 100, 85, 90]
]
for i in grade:
sum1 = 0
for j in i:
if isinstance(j, int):
sum1 += j
print(f'{i[0]}的总成绩为{sum1}')
# 冒泡排序
a = [5, 2, 4, 7, 9, 1, 3, 5, 4, 0, 6, 1, 3]
def maopao(b):
m = 0
while m < len(b) - 1:
j = 0
while j < len(b) - 1 - m:
if b[j] > b[j + 1]:
b[j], b[j + 1] = b[j + 1], b[j]
j += 1
m += 1
maopao(a)
print(a)