9.4 列表的遍历
# list = [87,69,75,93]
# 1 for 循环遍历
# for i in list:
# print(i)
# 2 while 遍历
# j = 0
# while j < len(list):
# print("list列表中的第%d个元素的值是: %d"%(j+1),list[j])
# j+=1
# 3 使用索引进行遍历
# for index in range(len(list)):
# print("list列表中索引为的第%d个元素的值是: %d"%((index),list[index]))
9.5 列表的常见计算操作
list1 = [74,75,87,62,95]
list2 = [57,84,75,93,68,71]
list3 = [88,81,64,73]
# 合并3个小组的成绩
list = list1+list2+list3
# 求最大值
max = max(list)
# 求最小值
min = min(list)
# 求和和平均值
sum = sum(list)
avg = sum/len(list)
print('''max:%d
min:%d
sum:%d
avg:%.1f
'''%(max,min,sum,avg))
9.6 列表的排序
9.6.1 sort()
list=[74,75,87,62,95,57,84,75,93,68,71,88,81,64,73]
print("原",list)
list.sort()
print("升序",list)
list.sort(reverse=True)
print("降序",list)
9.6.2 reverse()和[::-1]
list=[74,75,87,62,95,57,84,75,93,68,71,88,81,64,73]
print("原",list)
# list.reverse()
# print("反向排序",list)
list[::-1]
print("切片反排",list)
print("原",list)
# list.sort(reverse=True)
# print("降序",list)
9.7 嵌套列表
# 1. 嵌套列表元素的读取
# list=[[74,75,87,62,95],[57,84,75,93,68,71],[88,81,64,73]]
# print(list[0])
# print(list[0][0])
# print(list[1][0:4])
# 2. 嵌套列表元素的遍历
# 嵌套列表元素的遍历
# index1=0
# for i in list:
# for j in list[index1]:
# print(j,end=" ") #打印内层循环的值
# index1+=1
# print()
# 3. 列表的嵌套应用
list=[[74,75,87,62,95],[57,84,75,93,68,71],[88,81,64,73]]
# 3.1
# for j in range(len(list)): #外层for循环的长度 j 0,1,2
# k=0
# for i in list[j]: #
# list[j][k]=str(i) #
# k+=1
# print(list)
#3.2
# for j in range(len(list)): #外层for循环的长度 j 0,1,2
# for i in range(len(list[j])): #
# list[j][i]=str(list[j][i]) #
# print(list)
#3.3
for i in list: #外层for循环的长度 i 0,1,2
for j in range(len(i)): #
i[j]=str(i[j]) #
print(list)
9.8
9.8.1
# 任务一: 斐波那契数列
i,j = 1,1
list=[]
k = 0
while k < 10:
if k < 1:
list.append(i)
list.append(i)
else:
i = i + j
j = i + j
list.append(i)
list.append(j)
k+=1
print(list)
9.8.2
# 任务二: 杨辉三角
list,list1,list2 = [],[],[]
a = 1
for i in range(10):
# list1内层列表添加元素,并赋值(值赋予非引用)给list2,
list1.append(a)
list.append(list1[:]) # 值传递
j = 2
while i >= j:
list[i][j-1]=list[i-1][j-2]+list[i-1][j-1]
j+=1
# if i >= j :
# list[i][j - 1] = list[i - 1][j - 2] + list[i - 1][j - 1]
# if i >= 2 :
# list[i][1]=list[i-1][0]+list[i-1][1]
# if i >= 3:
# list[i][2]=list[i-1][1]+list[i-1][2]
# if i >= 4:
# list[i][3]=list[i-1][2]+list[i-1][3]
# if i >= 5:
# list[i][4]=list[i-1][3]+list[i-1][4]
# if i >= 6:
# list[i][5]=list[i-1][4]+list[i-1][5]
# if i >= 7:
# list[i][6]=list[i-1][5]+list[i-1][6]
# if i >= 8:
# list[i][7]=list[i-1][6]+list[i-1][7]
# if i >= 9:
# list[i][8]=list[i-1][7]+list[i-1][8]
print(list[i])
# list[0][0]
# list[1][0],list[1][1]
# list[2][0],list[2][1], list[2][2]
# list[3][0],list[3][1], list[3][2], list[3][3]