擅长:python、mysql、java
<p>这里有一种简单的方法来检测递归代码</p>
<pre><code>import inspect
def f(s):
print " " * (len(inspect.stack())-2), '>>', s
if len(s) <= 1:
print " " * (len(inspect.stack())-2), '<<', s
return s
else:
retval = f(f(s[1:])) + s[0] #Note double recursion
print " " * (len(inspect.stack())-2), '<<', retval
return retval
print f('world')
</code></pre>
<p>印刷品</p>
^{pr2}$