Discuss / Python / 尾递归测试
Back

尾递归测试

Topic source

Silences龙

#1 Created at ... [Delete] [Delete and Lock User]

首先说下我使用的环境：python3.9，编辑工具：pycharm2020.3

我复制阶乘代码如下：

def move2(x):    if x == 1:        return 1    return x * move2(x-1)print(move2(999))

执行后才报错：RecursionError: maximum recursion depth exceeded in comparison

是否最新版本的python自动做了递归优化，请各位大神解惑！

用户6452676203

#2 Created at ... [Delete] [Delete and Lock User]

sum(999)结果太大了，可以改为99。

白杨树叶家

#3 Created at ... [Delete] [Delete and Lock User]

我也是3.9测试了几次，很确认，没有尾递归优化

  • 1

Reply