python - 控制无限递归的更好方法

Question

我想知道是否有一种标准方法或比我下面的代码更好的方法来控制无限递归？我希望我的递归函数在最大尝试后放弃。下面的代码通过引入 attempt 方法参数并在递归调用期间递增它来实现。有没有更好的办法？

def Rec(attempt=0):
    if attempt==10:
        return()
    else:
        print(attempt)
        Rec(attempt=attempt+1)

Rec()

Answer 1

也有这种方式但不推荐用于你想做的事情 - 我只是发布它以供引用，在其他情况下也很好用......

#!/usr/bin/env python 

import sys
sys.setrecursionlimit(5)

def Rec(attempt=0):
    print attempt
    Rec(attempt=attempt+1)

try:
    Rec()
except RuntimeError:
    print 'maximum recursion depth exceeded'

来自 sys.setrecursionlimit(limit)更清楚地说，正如 python 文档中所述，sys.setrecursionlimit(limit) 所做的是:

Set the maximum depth of the Python interpreter stack to limit. This limit prevents infinite recursion from causing an overflow of the C stack and crashing Python.

The highest possible limit is platform-dependent. A user may need to set the limit higher when she has a program that requires deep recursion and a platform that supports a higher limit. This should be done with care, because a too-high limit can lead to a crash.

所以在我看来，除非您非常清楚自己在做什么，否则不要乱用 Python 解释器堆栈。