def AVG(Nums): # 分别保存求和值和成员数量 Sum, numCount = 0, 0 for everyNum in Nums: Sum += everyNum numCount += 1 return Sum / numCount
O(1)
O(n)
O(n+4)
O(n²)