擅长:python、mysql、java
<p>如果您需要另一种递归方法:</p>
<pre><code>def reverseList(listXS):
return [] if not listXS else [listXS.pop()] + reverseList(listXS)
</code></pre>
<p>或切片:</p>
^{pr2}$
<p>如果您需要就地解决方案:</p>
<pre><code>def reverseList(listXS, i=1):
if i == len(listXS) - 1:
return
listXS[i-1], listXS[-i] = listXS[-i], listXS[i-1]
reverseList(listXS, i+1)
</code></pre>
<p>颠倒原始列表:</p>
<pre><code>In [22]: l = [1, 2, 3, 4,5]
In [23]: reverseList(l)
In [24]: l
Out[24]: [5, 4, 3, 2, 1]
In [25]: l = [1, 2, 3, 4]
In [26]: reverseList(l)
In [27]: l
Out[27]: [4, 3, 2, 1]
</code></pre>