Python学习Day09

#汉诺塔———递归的应用
‘’'count=0
def hanoi(n,src,dst,mid):
global count
if n1:
print("{}:{}->{}".format(1,src,dst))
count+=1
else:
hanoi(n-1,src,mid,dst)
print("{}:{}->{}".format(n,src,dst))
count+=1
hanoi(n-1,mid,dst,src)
hanoi(5,“A”,“B”,“C”)’’’
科赫雪花的绘制
import turtle
def koch(size,n):
if n0:
turtle.fd(size)
else:
for angle in [0,60,-120,60]:
turtle.left(angle)
koch(size/3,n-1)
def main():
turtle.setup(600,600)
turtle.penup()
turtle.goto(-200,100)
turtle.pendown()
turtle.pensize(2)
turtle.pencolor(“pink”)
koch(400,3)#size为绘制的直线长度
turtle.right(120)
koch(400, 3)
turtle.right(120)
koch(400, 3)
turtle.hideturtle()
main()
还学习了集合、序列、元组、列表的定义以及通用函数及方法