擅长:python、mysql、java
<p>在这里,我会尽力为你澄清:)</p>
<p>编写一个列出从1到n的数字的函数很简单。
如果我们试着运行这个函数</p>
<pre><code>def recursiveFunc(i):
print(i)
recursiveFunc(i+1)
recursiveFunc(1)
</code></pre>
<p>它会打印出1,然后是2,3。。。。但永远不会停止。你知道吗</p>
<pre><code>1
2
3
...
</code></pre>
<p>为了解决这个问题,我们添加了第二个参数</p>
<pre><code>def recursiveFunc(i, n):
if i > n:
return
print(i)
recursiveFunc(i+1)
recursiveFunc(1, 100)
</code></pre>
<p>当函数经过n(在本例中为100)时,它将转义函数</p>
<pre><code>1
2
...
100
</code></pre>
<p>如果您想返回系列而不是仅仅打印出来,您可以这样做:</p>
<pre><code>def recursiveFunc(i, n):
if i >= n:
return str(i)
return str(i) + ", " + str(recursiveFunc(i + 1, n))
print(recursiveFunc(1, 100))
</code></pre>
<p>那么输出就是</p>
<pre><code>1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100
</code></pre>