python递归三角形_Python中三角形收缩的递归方法

首先，很好的尝试。你真的很亲密。这看起来是个有趣的项目。：)

我已经修复了您的代码，并将其包含在下面。你需要做的就是添加一个特殊条件来检查你是否在“基地”三角形上。如果是，就回来！在import turtle

def drawTriangle(size):

turtle.left(30)

turtle.forward(size)

turtle.right(120)

turtle.forward(size)

turtle.right(120)

turtle.forward(size)

turtle.right(120)

turtle.up()

turtle.forward(size)

turtle.right(30)

turtle.down()

def drawTriangles(size, depth, baseTriangle = False):

if (depth < 1):

pass

else:

drawTriangle(size)

drawTriangles(size / 2, depth - 1)

if baseTriangle:

return

turtle.up()

turtle.left(30)

turtle.forward(-size)

turtle.right(120)

turtle.forward(size * 2)

turtle.left(90)

turtle.down()

drawTriangle(size)

drawTriangles(size / 2, depth - 1)

turtle.up()

turtle.left(30)

turtle.forward(-size)

turtle.left(60)

turtle.forward(size * 2)

turtle.right(90)

turtle.down()

turtle.home()

turtle.left(90)

turtle.down()

turtle.speed("normal")

drawTriangles(100, 4, baseTriangle = True)

input("pause")