使用java进行Fibonacci序列剪枝

public class FibonacciPruning {
    public static long fibonacci(int n, long threshold) {
        if (n <= 1) {
            return n;
        }
        
        long[] fib = new long[n + 1];
        fib[0] = 0;
        fib[1] = 1;
        
        for (int i = 2; i <= n; i++) {
            fib[i] = fib[i - 1] + fib[i - 2];
            
            if (fib[i] > threshold) {
                return fib[i];
            }
        }
        
        return fib[n];
    }
    
    public static void main(String[] args) {
        int n = 50;
        long threshold = 1000000;
        
        long result = fibonacci(n, threshold);
        System.out.println("Fibonacci(" + n + ") = " + result);
    }
}