擅长:python、mysql、java
<p>同心正方形需要使用递归算法(与迭代相反):</p>
<pre><code>import turtle
def draw_square(t, size):
for i in range(4):
t.forward(size)
t.left(90)
def recursive_draw(t, x, y, size):
if (size < 200):
t.penup()
t.goto(x, y)
t.pendown()
draw_square(t, size)
x -= 10
y = x
size += 20
recursive_draw(t, x, y, size)
wn = turtle.Screen()
dan = turtle.Turtle()
recursive_draw(dan, 0, 0, 1)
</code></pre>
<p>用这种方式来解释代码似乎更容易:</p>
<p>基本情况:大小不能超过200
接近策略:增加20个大小</p>