0x01 列表求和
s = 0
for x in seq:
s += x
0x02 迭代
seq1 = [[0, 1], [2], [3, 4, 5]]
s = 0
for seq2 in seq1:
for x in seq2:
s += x
0x03 树
class Tree:
def __init__(self, left, right):
self.left = left
self.right = right
0x04 构造10*10 矩阵
m = [[0]*10]*10
print m
那一个数独 就是 [[0]*9]*9
0x05
sum(f(i)for i in range(m,n+1)
0x06 产生一个随机的列表,1-100
from random import randrange
seq = [randrange(10*10)for i in range (100)]