练习

a = [[1,2,3],[4,5,6],[7,8,9]]
b = []
for i in range(len(a)):
    c = []
    for j in range(len(a)):
        c.append(a[j][i])
    b.append(c)
print(b)

1, 給 定一个 3*3方阵，求其转置矩阵

例如:[[1,2,3],[4,5,6],[7,8,9]]--> [[1,4,7],[2,5,8],[3,6,9]]

list1 = []
k=0
a = [[1,2,3],[4,5,6],[7,8,9]]
for i in range(len(a)):
    list1.append([])
    for j in range(len(a)):
        list1[i].append(a[j][k])
    k += 1

print(list1)

 

 

a = [[1,2,3],[4,5,6],[7,8,9]]
for i in range(len(a)):
    for j in range(i):
        a[i][j] ,a[j][i] =a[j][i],a[i][j]
        print(a)

 

随机产生一组验证码

import random
for i in range(10):
    #print(str(random.randint(1,100)).rjust(4,'0')+"."+ ''.join(random.sample('abcdefghijklmnopqrstuvwsyxABCDEFGHJIKLMNOPQRSTUVWSYZ',10)))
    print('{:0>4}.{}'.format(random.randint(1,100),''.join(random.sample('abcdefghijklmnopqrstuvwsyxABCDEFGHJIKLMNOPQRSTUVWSYZ',10))))

 

 

 

斐波拉契数列

import datetime
start = datetime.datetime.now()
pre = 0
cur = 1
print(pre,cur,end=' ')
n = 35
for i in range(n-1):
    pre,cur =cur,pre+cur
    print(cur,end=' ')
delta = (datetime.datetime.now()-start).total_seconds()
print()
print(delta)

 

import datetime
n = 35
start=datetime.datetime.now()
def fib(n):
    return 1 if n<2 else fib(n-1) +fib(n-2)
for i in range(n):
    print(fib(i))
delta =(datetime.datetime.now()-start).total_seconds()
print(delta)

斐波拉契数列，效率比较好，先算好之前的结果
pre = 0
cur = 1
print(pre,cur,end=' ')
def fib(n,pre=0,cur=1):
    pre,cur=cur,pre+cur
    print(cur,end=' ')
    if n == 2:
        return
    fib(n-1,pre,cur)
fib(35)

 

def fib(n,pre=0,cur=1):
    pre,cur=cur,pre+cur
    print(cur,end=' ')
    if n == 1:
        return
    fib(n-1,pre,cur)
fib(5)