zoukankan      html  css  js  c++  java
  • 多线程累加求和

    多线程问题,很重要的一点是代码和数据分离

    看了这篇文章,感觉内部类用的很好玩,略有启发,对其中错误的地方修改了下,并去除了取处理器核数和线程池的代码,重新写了一个demo。

    Java并发和多线程2:3种方式实现数组求和

    其实对这个结果并不满意,因为这个demo中,为各个线程分配任务的方式不太好,太死板,按说应该让各个线程自己去抢任务。

    package learnThread;
    
    import java.util.ArrayList;
    import java.util.List;
    import java.util.concurrent.Callable;
    import java.util.concurrent.ExecutionException;
    import java.util.concurrent.FutureTask;
    
    /**
     * @author lakeslove
     * 多线程累加求和
     * 
     */
    public class SumCalculator{
        private class Sum implements Callable<Integer>{
            private int subMin;
            private int subMax;
            public Sum(int subMin,int subMax){
                this.subMin = subMin;
                this.subMax = subMax;
            }
            @Override
            public Integer call() throws Exception {
                int sum = 0;
                for(int i = subMin;i <= subMax;i++){
                    sum += i;
                    System.out.println(Thread.currentThread().getName() + "-------" + sum);
                }
                return sum;
            }
        }
    
        /**
         * 求和范围是 min ~ max
         * @param min
         * @param max
         * @param threadNum
         * @return
         */
        public Integer getSum(int min, int max, int threadNum){
            int subMin;
            int subMax;
            List<FutureTask<Integer>> taskList = new ArrayList<>();
            int sumCounts = max - min + 1;
            int subCounts = sumCounts/threadNum;
            int remainder = sumCounts%threadNum;
            int mark = min;
            for(int i = 0;i<threadNum;i++){
                subMin = mark;
                if(remainder!=0&&remainder>i){
                    subMax = subMin + subCounts;
                }else{
                    subMax = mark + subCounts - 1;
                }
                mark = subMax + 1;
                System.out.println(subMin +":"+subMax);
                FutureTask<Integer> task = new FutureTask<Integer>(new Sum(subMin,subMax));
                taskList.add(task);
                new Thread(task).start();
            }
            int sum = taskListSum(taskList);
            return     sum;
        }
        
        private Integer taskListSum(List<FutureTask<Integer>> taskList){
            int sum = 0;
            for(FutureTask<Integer> task : taskList){
                try {
                    sum += task.get();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                } catch (ExecutionException e) {
                    e.printStackTrace();
                }
            }
            return     sum;
        }
        
    
        /**
         * @param args
         * 测试
         */
        public static void main(String[] args){
            SumCalculator sumCalculator = new SumCalculator();
            int sum = sumCalculator.getSum(1, 100, 5);
            System.out.println(sum);
        }
    
    }
  • 相关阅读:
    1065 a+b and c(64)
    1049 counting ones
    1040 the longest symmetric
    1039 course list for student
    1038 recover the smallest number
    1035 head of a gang
    1033 to fill or not to fill
    node环境下通过redis共享session记录
    vue+koa+sequlize 搭建使程序员专注业务代码开发框架---对于nunjucks引入webpack后,产生的文件缓存相关的思考(四)
    charless抓包https---记录一下菜鸡的日常
  • 原文地址:https://www.cnblogs.com/lakeslove/p/7104662.html
Copyright © 2011-2022 走看看