Python小白丁日记(6)——递归函数(绘制分形树)

import turtle

def draw_branch(branch_length):

     if branch_length>5:
         turtle.forward(branch_length)
         print('向上',branch_length)
         turtle.right(20)
         print('右转20')
         draw_branch(branch_length-15)


         turtle.left(40)
         print('左转40')
         draw_branch(branch_length-15)

         turtle.right(20)
         print('右转20')
         turtle.backward(branch_length)
         print('向下',branch_length)


def main():
    turtle.left(90)
    turtle.penup()
    turtle.backward(200)
    turtle.pendown()
    turtle.pensize(5)
    turtle.pencolor("green")


    draw_branch(50)
    turtle.exitonclick()


if __name__ == '__main__':
    main()

 

python知识都是跟着小象学院梁斌老师的教学视频课敲的代码,梁老师讲得很好,有兴趣的同学可以去学习,如有违规,侵删

相关文章:

  • 2021-12-20
  • 2021-09-30
  • 2022-12-23
  • 2021-09-26
  • 2021-11-06
  • 2022-12-23
  • 2022-12-23
  • 2021-11-28
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2021-08-15
  • 2021-09-29
  • 2021-06-04
  • 2021-07-14
  • 2021-11-30
相关资源
相似解决方案