<pre><code>from pythonds.basic.stack import Stack
rStack = Stack()
def toStr(n,base):
convertString = "0123456789ABCDEF"
while n > 0:
if n < base:
rStack.push(convertString[n])
else:
rStack.push(convertString[n % base])
n = n // base
res = ""
while not rStack.isEmpty():
res = res + str(rStack.pop())
return res
print(toStr(1345,2))
</code></pre>
<p>我指的是<a href="http://interactivepython.org/runestone/static/pythonds/Recursion/StackFramesImplementingRecursion.html" rel="nofollow">this tutorial</a>,还粘贴了上面的代码。教程说这个函数是递归的,但是我没有看到递归调用,只有while循环。我错过了什么?在</p>