1.已知一个数字列表,求列表中心元素。
n = ['x', 5, '*', True, 'k', False] # 设置列表
z = len(n) // 2
if len(n) % 2:
print(n[z])
else:
print(n[z - 1], n[z])
2.已知一个数字列表,求所有元素和。
n = [8, 5, 45, 6, 125, 8552, 99, 25, 9654] # 设置列表
k = 0
for x in n:
k += x
print(k)
3.已知一个数字列表,输出所有奇数下标元素。
n = [8, 5, 45, 6, 125, 8552, 99, 25, 9654] # 设置列表
for x in range(len(n)):
if x % 2:
print(n[x])
4.已知一个数字列表,输出所有元素中,值为奇数的元素。
n = [8, 5, 45, 6, 125, 8552, 99, 25, 9654] # 设置列表
for x in n:
if x % 2:
print(x)
5.已知一个数字列表,将所有元素乘二。
例如:nums = [1, 2, 3, 4] —> nums = [2, 4, 6, 8]
n = [8, 5, 45, 6, 125, 8552, 99, 25, 9654] # 设置列表
k = []
for x in n:
k.append(x * 2)
print(k)
6.有一个长度是10的列表,数组内有10个人名,要求去掉重复的
例如:names = [‘张三’, ‘李四’, ‘大黄’, ‘大黄’, ‘张三’, ‘张三’, ‘张三’] -> names = [‘张三’, ‘李四’, ‘大黄’]
names = ['张三', '张三', '大黄', '大黄', '李四', '张三', '李四', '张三', '张三', '大黄']
for x in range(9, -1, -1):
for x_0 in names[0: x]:
if names[x] == x_0:
names.remove(x_0)
break
print(names)
7.用一个列表来保存一个节目的所有分数,求平均分数(去掉一个最高分,去掉一个最低分,求最后得分)
scores = [95, 75, 99, 65, 82, 72, 93, 78, 78, 99, 65]
gao = di = scores[0]
average = 0
for x in scores:
if gao <= x:
gao = x
if di >= x:
di = x
scores.remove(gao)
scores.remove(di)
for x_0 in scores:
average += x_0
print('平均分:', average / len(scores))
8.有两个列表A和B,使用列表C来获取两个列表中公共的元素
例如: A = [1, ‘a’, 4, 90] B = [‘a’, 8, ‘j’, 1] --> C = [1, ‘a’]
A = [1, 'a', 4, 90, '成']
B = ['a', 8, 'j', 1, 90]
c = []
for x in A:
for x_0 in B:
if x == x_0:
c.append(x)
print(c)
9.*有一个数字列表,获取这个列表中的最大值.(注意: 不能使用max函数)
例如: nums = [19, 89, 90, 600, 1] —> 600
nums = [19, 89, 90, 600, 1]
gao = nums[0]
for x in nums:
if gao <= x:
gao = x
print('最大值:', gao)
10.*获取列表中出现次数最多的元素
例如:nums = [1, 2, 3,1,4,2,1,3,7,3,3] —> 打印:3
nums = [1, 2, 3, 1, 4, 7, 7, 7, 3, 7, 2, 1, 3, 7, 3, 3]
count2 = 0
c = []
d = []
for x in nums:
count1 = 0
for x_0 in nums:
if x == x_0:
count1 += 1
c.append(count1)
for h in range(len(c)):
if count2 <= c[h]:
count2 = c[h]
for k in range(len(c)):
if count2 == c[k]:
d.append(nums[k])
for n in range(len(d) - 1, -1, -1):
for n_0 in d[0: n]:
if d[n] == n_0:
d.remove(n_0)
break
print(d)