JAVA堆栈溢出发生之前确定的极限，斐波那契序列

Question

我试图计算使用2种不同的方法，一种递归Fibonacci序列和使用循环的其他。如果要求用户输入数字，我很难确定如何确定每种方法的限制。这里是我的代码：

import java.util.Scanner; 
public class Recursion { 

public static void main(String[] args) 
{ 
    Scanner kb = new Scanner(System.in); 
    long n, result1, result2, startTime1, stopTime1, startTime2, stopTime2; 

    System.out.println("Please Enter A Number in between 0 and maxValue, will be calcualtred using 2 methods...."); 
    n = kb.nextLong(); 

    startTime1 = System.nanoTime(); 
    result1 = fibRecursive(n); 
    stopTime1 = System.nanoTime(); 

    startTime2 = System.nanoTime(); 
    result2 = fibLoop(n); 
    stopTime2 = System.nanoTime(); 

    System.out.println("\nDisplaying solution for recursive method: "+ result1 + " Time Taken (in nanoseconds): " + (stopTime1 - startTime1)); 
    System.out.println("\nDisplaying solution for loop method: "+ result2 + " Time Taken (in nanoseconds): " + (stopTime2 - startTime2)); 
    System.out.println("\nThanks for using our fibnoacci calculator. "); 
} 

public static long fibRecursive(long i) 
{ 
    if(i == 0) 
     return 0; 
    else if(i == 1) 
     return 1; 
    else 
     return fibRecursive(i - 1) + fibRecursive(i - 2); 
} 
public static long fibLoop(long k) 
{ 
    long a = 0, b = 1, ans = 0; 
    if(k == 0) 
     return 0; 
    else if(k == 1) 
     return 1; 
    else 
    for(int i = 1; i < k; i++) 
    { 
     ans = a + b; 
     a = b; 
     b = ans;  
    } 
    return ans; 
} 

Answer 1

另一种方法可以尝试捕捉错误。

try { 

} catch(StackOverflowError e){ 
     System.err.println("ouch!"); 
}