java线程数组_java面试题-多线程数组求和(CountDownLatch实现)

CountDownLatch是一个线程等待其他的所有线程执行完成。

先对数组进行分段,每段求和,主线程等待所有线程计算完成之后,在执行整体求和。

public class CountDownLatchTest {

CountDownLatchTest(int count) {

this.count = count;

executorService = Executors.newFixedThreadPool(count);

countDownLatch = new CountDownLatch(count);

}

private Map sumMap = new HashMap<>();

private int count = 4;

private CountDownLatch countDownLatch;

private ExecutorService executorService;

public int sum(int[] arr) {

int size = arr.length;

int batch = size / count + 1;

for (int i = 0; i < count; i++) {

int end;

int start;

start = i * batch;

end = Math.min(start + batch, size);

System.out.println(start + " " + end);

executorService.execute(new Calculator(arr, start, end));

}

try {

countDownLatch.await();

} catch (InterruptedException e) {

e.printStackTrace();

}

executorService.shutdown();

return sumMap.values().stream().reduce(Integer::sum).get();

}

public static void main(String[] args) {

int[] arr = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};

CountDownLatchTest countDownLatchTest = new CountDownLatchTest(4);

System.out.println(countDownLatchTest.sum(arr));

}

class Calculator implements Runnable {

private int[] arr;

private int start;

private int end;

Calculator(int[] arr, int start, int end) {

this.arr = arr;

this.start = start;

this.end = end;

}

@Override

public void run() {

int sum = 0;

for (int i = start; i < end; i++) {

sum += arr[i];

}

sumMap.put(Thread.currentThread().getName(), sum);

countDownLatch.countDown();

}

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值