python递归实现谢尔宾斯基三角形

兄弟萌，话不多说，show me the code!

import turtle

t = turtle.Turtle()

def sierpinski(degree,points):
    colormap = ['blue','red','green','white','yellow','orange','brown']
    drawTriangle(points,colormap[degree%len(colormap)])
    if degree > 0:
        sierpinski(degree-1,
                   {'left':points['left'],
                    'top':getMid(points['left'],points['top']),
                    'right':getMid(points['left'],points['right'])})
        sierpinski(degree-1,
                   {'left':getMid(points['left'],points['top']),
                    'top':points['top'],
                    'right':getMid(points['top'],points['right'])})
        sierpinski(degree-1,
                   {'left':getMid(points['left'],points['right']),
                    'top':getMid(points['top'],points['right']),
                    'right':points['right']})

def drawTriangle(points,color):
    t.fillcolor(color)
    t.penup()
    t.goto(points['top'])
    t.pendown()
    t.begin_fill()
    t.goto(points['left'])
    t.goto(points['right'])
    t.goto(points['top'])
    t.end_fill()

def getMid(p1,p2):
    return ((p1[0]+p2[0])/2, (p1[1]+p2[1])/2)

if __name__ == '__main__':
    points = {'left':(-200,-100),'top':(0,200),'right':(200,-100)}
    sierpinski(3,points)
    turtle.done()