python 字典排序 递归斐波那契 九九乘法 遍历文件夹

字典排序

Key值排序

D={‘lilee’:25,’wangyan’:21,’lidan’:19}

1. keys()
2. values()

1. items()列表元组类型

[('lilee', 25), ('wangyan', 21), ('lidan', 19)]

d=sorted(d.items(),key=lambda item:item[1])

 

 

递归斐波那契

Def fib(0):

If n<=1:

Return n

Else:

Return fib(n-1)+fin(n-2)

冒泡排序

Def mpao(nums):

For i in range(len(nums)-1):

For j in range(len(nums)-i-1):

If nums[j]>nums[j+1]:

Nums[j],nums[j+1]=nums[j+1],nums[j]

Return nums

九九乘法

for i in range(1,10):
    for j in range(1,i+1):
        print("{0}*{1}={2}  ".format(i,j,i*j),end='')
    print('')

 

遍历文件夹

import os
def list_dir(rootdir):
    listd=os.listdir(rootdir)
    for i in range(len(listd)):
        path=os.path.join(rootdir,listd[i])
        if os.path.isdir(path):
            list_dir(path)
        if os.path.isfile(path):
            print(path)
list_dir(r'D:\软件')