在Java中使用线程和递归来计算Fibonacci数

public class FibonacciThread extends Thread {
    private int n;
    private int result;

    public FibonacciThread(int n) {
        this.n = n;
    }

    public void run() {
        if (n <= 1) {
            result = n;
        } else {
            FibonacciThread t1 = new FibonacciThread(n - 1);
            FibonacciThread t2 = new FibonacciThread(n - 2);
            t1.start();
            t2.start();
            try {
                t1.join();
                t2.join();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
            result = t1.getResult() + t2.getResult();
        }
    }

    public int getResult() {
        return result;
    }
}

public class FibonacciRecursive {
    public static int fibonacci(int n) {
        if (n <= 1) {
            return n;
        } else {
            return fibonacci(n - 1) + fibonacci(n - 2);
        }
    }
}