1.递归访问目录: 且目录中嵌套目录,有层次的列出给定目录中所有的文件和文件夹
#切换目录: os.chdir(path)
#列出当前目录中所有的文件和文件夹 os.listdir(path), path: 绝对路径
#判断是否是文件: os.path.isfile(path)
#判断是否是目录: os.path.isdir(path)
#拼接路径: os.path.join(path1, path2, path3…)
import os
os.chdir("C:\JavaDev") #切换目录
print(os.listdir()) #1.列出当前目录中所有的文件和文件夹
print(os.path.isfile("C:\JavaDev")) #2.判断是否是文件
print(os.path.isdir("C:\JavaDev")) #3.判断是否是目录
print(os.path.split("C:\JavaDev" "C:\Program Files\Oracle")) #4.拼接路径
结果:2.定义一个嵌套函数
外层函数打印:This is outing function
内层函数打印:This is inner function
def outer():
def inner():
print("This is inner function")
inner()
print("This is outing function")
outer()
结果:
3.定义一个递归函数:打印斐波那契数列
F[n] = F[n - 1] + F[n - 2] (n>=2,F[0]=0,F[1]=1)
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n-1) + fibonacci(n-2)
print([fibonacci(x) for x in range(10)])
结果:
4.对列表进行排序: list_data = [“grape”, “peach”, “berry”, “pineapple”, “apple”, “strayberry”, “watermelon”]
排序规则:按照最后一个字符进行排序,如果最后一个字符相等,按照第一个字符排序
list_data = ["grape", "peach", "berry", "pineapple", "apple", "strayberry", "watermelon"]
rule = lambda x: (x[-1], x[0])
list_data.sort(key=rule)
print(list_data)
结果:
5.利用map函数: 计算三个列表,相同位置元素之和
list1 = [1, 2, 3]
list2 = [4, 5, 6]
list3 = [7, 8, 9]
list1 = [1, 2, 3]
list2 = [4, 5, 6]
list3 = [7, 8, 9]
i = map(lambda x, y, z: (x + y + z), list1, list2, list3)
print(list(i))
结果:
6.利用filter函数过滤列表中所有带a的字符串
list_data = [“grape”, “what”, “which”, “you”, “friend”, “am”]
list_data = ["grape", "what", "which", "you", "friend", "am"]
print(list(filter(lambda x: "a" in x, list_data)))
结果:
7.利用reduce计算1 + 2 + 3…+ 100之和
from functools import reduce
data = reduce(lambda x, y: x+y, list(range(1, 101)))
print(data)
结果: