![](/img/trans.png)
[英]Pycharm - Running Open CV Code goes straight to “Process finished with exit code 139 (interrupted by signal 11: SIGSEGV)”
[英]Python recursion test in PyCharm - Process finished with exit code 139
系统: Ubuntu 14
IDE: PyCharm 社区版 3.1.1
蟒蛇: 2.7.6
循环调用算法:
def fibonacci_dynamic(n):
if n == 0:
return 0
if n == 1:
return 1
computed_values = {1: 1, 2: 1}
return memoize(n, computed_values)
def memoize(n, computed_values):
if n in computed_values:
return computed_values[n]
#recurrent call
computed_values[n - 1] = memoize(n - 1, computed_values)
computed_values[n - 2] = memoize(n - 2, computed_values)
new_value = computed_values[n - 1] + computed_values[n - 2]
computed_values[n] = new_value
return new_value
测试:
from unittest import TestCase
from first.fib.fibonacci import fibonacci_dynamic
import sys
sys.setrecursionlimit(40000)
class TestFibonacci_dynamic_param(TestCase):
def test_fibonacci_dynamic_26175(self):
result = fibonacci_dynamic(26175)
self.assertIsNotNone(result)
测试中的值是预期的。 大约值26175
测试有时会通过,但有时会以消息终止: Process finished with exit code 139
我知道测试结果在某种程度上取决于硬件资源,但我正在寻找来自 stackoverflow 前辈的更准确的答案:)
您可以使用非递归算法来计算斐波那契数
class FibonacciNumbers(object):
def __init__(self):
self._fib = [0, 1, 1] #first three fibonacci numbers
def get(self, n):
if n < len(self._fib):
return self._fib[n]
for i in xrange(len(self._fib), n+1):
self._fib.append(self._fib[i-1] + self._fib[i-2])
return self._fib[-1]
fib = FibonacciNumbers()
print fib.get(0)
print fib.get(1000)
或者使用公式:
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.