黑馬博學(xué)谷人工智能與數(shù)據(jù)挖掘
Fork/Join 框架 => 分而治之的實(shí)例
// ForkJoinPool 解決數(shù)組求和public class ArraySumForForkJoinPool {
? ?public static int sumParallel(int[] array) throws ExecutionException, InterruptedException {
? ? ? ?ForkJoinPool pool = new ForkJoinPool();
? ? ? ?return pool.submit(new SubArraySum(array, 0, array.length - 1)).get();
? ?}
? ?public static void main(String[] args) throws ExecutionException, InterruptedException {
? ? ? ?System.out.println(sumParallel(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9}));
? ?}}class SubArraySum extends RecursiveTask<Integer> {
? ?private final int[] array;
? ?private final int start;
? ?private final int end;
? ?public SubArraySum(int[] array, int start, int end) {
? ? ? ?this.array = array;
? ? ? ?this.start = start;
? ? ? ?this.end = end;
? ?}
