demo1: 使?Fork/Join来求,斐波那契数列第n项
斐波那契数列数列是?个线性递推数列,从第三项开始,每?项的值都等于
前两项之和:
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89······
如果设f(n)为该数列的第n项(n∈N*),那么有:f(n) = f(n-1) + f(n-2)。
import org.junit.Test;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.Future;
import java.util.concurrent.RecursiveTask;
/**
* Created by DELL on 2020/7/20.
*/
public class FibonacciTest {
class Fibonacci extends RecursiveTask {
int n;
public Fibonacci(int n) {
this.n = n;
}
// 主要的实现逻辑都在compute()?
@Override
protected Integer compute() {
// 这?先假设 n >= 0
if (n <= 1) {
return n;
} else {