import java.util.concurrent.ForkJoinPool; import java.util.concurrent.RecursiveTask; public class FibonacciTask extends RecursiveTask<Integer> { private final int n; public FibonacciTask(int n) { this.n = n; } @Override protected Integer compute() { if (n <= 1) { return n; } FibonacciTask f1 = new FibonacciTask(n - 1); f1.fork(); FibonacciTask f2 = new FibonacciTask(n - 2); f2.fork(); return f1.join() + f2.join(); } public static void main(String[] args) { ForkJoinPool forkJoinPool = ForkJoinPool.commonPool(); FibonacciTask task = new FibonacciTask(10); int result = forkJoinPool.invoke(task); System.out.println("Result: " + result); } }


上一篇:
下一篇:
切换中文