- 创建一个列表,列表中有10个数字, 保证列表中元素的顺序,对列表进行排重,并对列表使用进行降序排序
例如:[70, 88, 91, 70, 107, 234, 91, 177, 282, 197]
--- 去重之后 [70, 88, 91, 107, 234, 177, 282, 197]
---- 降序排序 [282, 234, 197, 177, 107, 91, 88, 70]
# 1
nums=[70, 88, 91, 70, 107, 234, 91, 177, 282, 197]
nums=set(nums)
nums=list(nums)
nums.sort(reverse=True)
print(nums)
# 2
nums = [70, 88, 91, 70, 107, 234, 91, 177, 282, 197]
for i in range(len(nums)-1, -1, -1):
if nums[i] in nums[:i]:
del nums[i]
print(nums)
for i in range(len(nums)):
max1=max(nums[i:])
nums.remove(max1)
nums.insert(i,max1)
print(nums)
- 利用列表推导式, 完成以下需求
a. 生成一个存放1-100中各位数为3的数据列表
结果为 [3, 13, 23, 33, 43, 53, 63, 73, 83, 93]
a=[i*10+3 for i in range(10)]
b. 利用列表推到是将 列表中的整数提取出来
例如:[True, 17, "hello", "bye", 98, 34, 21] --- [17, 98, 34, 21]
b=[True, 17, "hello", "bye", 98, 34, 21]
new_b=[i for i in b if type(i)==int]
c.利用列表推导式 存放指定列表中字符串的长度
例如: ["good", "nice", "see you", "bye"] --- [4, 4, 7, 3]
c = ["good", "nice", "see you", "bye"]
new_c = [len(i) for i in c]
d. 利用列表推导式删除列表中整数个位数小于5的元素
例如:[24, 'abc', 99, True, 21, 38, 'hello'] --- ['abc', 99, True, 38, 'hello']
d = [24, 'abc', 99, True, 21, 38, 'hello']
new_d = [i for i in d if type(i)!=int or i%10 > 5]
e. 利用列表推导式获取元素是元组的列表中每个元组的最后一个元素
例如:[(10, 20, 30), ('abc', 'hello'), (1, 2, 3.4), (True, False)] --- [30, 'hello', 3.4, False]
e = [(10, 20, 30), ('abc', 'hello'), (1, 2, 3.4), (True, False)]
new_e = [i[-1] for i in e]
f.利用列表推导式将数字列表中所有的奇数乘以2,所有的偶数除以2
例如: [23, 4, 67, 88, 90, 21] -> [46, 2, 134, 44, 45, 42]
f = [23, 4, 67, 88, 90, 21]
new_f = [i*2 if i%2 else i/2 for i in f]
-
已知一个列表获取列表中指定元素所有的下标
例如:[10, 20, 34, 10, 9, 78] 10的下标:[0, 3] 20的下标:[1] 30的下标:[] nums=[10,20,34,10,9,78] nums_10=[i for i in range(len(nums)) if nums[i]==10] nums_20=[i for i in range(len(nums)) if nums[i]==20] nums_30=[i for i in range(len(nums)) if nums[i]==30] print(nums_10) print(nums_20) print(nums_30)
-
*已知一个数字列表,写程序判断这个列表时候是连续递增列表。
例如: [1, 2, 3, 4, 5] -> True [23, 45, 78, 90] -> True [1, 3, 2, 4, 5] -> False
a = [[1, 2, 3, 4, 5], [23, 45, 78, 90], [1, 3, 2, 4, 5]] for i in a: print('列表{}是连续递增列表:{}'.format(i,True if i == sorted(i) else False))
-
已知两个列表,将两个列表按照下面的规律交叉合并
A = [10, 20, 30, 40, 50] B = [100, 200, 300] 结果:[10, 100, 20, 200, 30, 300, 40, 50]
A = [10, 20, 30, 40, 50] B = [100, 200, 300] C = [] count = len(A) if len(A)<=len(B) else len(B) for i in range(count): C.extend([A[i], B[i]]) else: C += A[i+1:]+B[i+1:] print(C)
-
已知两个有序列表,将两个列表合并,合并后的新列表中元素仍然是递增列表
A = [10, 20, 30, 40, 50] B = [25, 44, 60] 结果:[10, 20, 25, 30, 40, 45, 50, 60]
#1 A = [10, 20, 30, 40, 50] B = [25, 44, 60] C = A+B C.sort() print(C) # 2 A = [10, 20, 30, 40, 50] B = [25, 44, 60] C = A.copy() count = len(A) a = 0 for j in B: for i in range(a, count): if i+1 == count: if A[i] < j: a += 1 C.insert(i + a, j) break if A[i] < j < A[i+1]: a += 1 C.insert(i+a, j) break print(C)