提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
文章目录
写代码
输出10以内的斐波拉契数列
查找10以内的素数
请写出一段Python代码,实现分组一个 list 里面的元素,比如[1,2,3,4,5,6,…,100],变成[[1,2,3],[4,5,6],…]
写一个循环,每30分钟输出一次内容,持续12小时
已知一个列表,找到列表中元素的最大值,并找出最大值出现的位置(可能是多个)
用lambda,按值排序
pairs = [(1,'one'),(2,'two'),(3,'three'),(4,'four')]
读代码
global,nonlocal用法
def scope_test():
def do_local():
spam = "local spam"
def do_nonlocal():
nonlocal spam
spam = "nonlocal spam"
def do_global():
global spam
spam = "global spam"
spam = "test spam"
do_local()
print("After local assignment:", spam)
do_nonlocal()
print("After nonlocal assignment:", spam)
do_global()
print("After global assignment:", spam)
scope_test()
print("In global scope:", spam)