fork/join

如果一个应用能被分解成多个子任务，并且组合多个子任务的结果就能够获得最终的答案，那么这个应用就适合用 Fork/Join 模式来解决

1. 用归并来思考也可以，分而治之。

public class Calculator extends RecursiveTask<Integer> {  

    private static final int THRESHOLD = 100;  
    private int start;  
    private int end;  

    public Calculator(int start, int end) {  
        this.start = start;  
        this.end = end;  
    }  

    @Override  
    protected Integer compute() {  
        int sum = 0;  
        if((start - end) < THRESHOLD){  
            for(int i = start; i< end;i++){  
                sum += i;  
            }  
        }else{  
            int middle = (start + end) /2;  
            Calculator left = new Calculator(start, middle);  
            Calculator right = new Calculator(middle + 1, end);  
            left.fork();  
            right.fork();  

            sum = left.join() + right.join();  
        }  
        return sum;  
    }  
  @Test  
public void run() throws Exception{  
    ForkJoinPool forkJoinPool = new ForkJoinPool();  
    Future<Integer> result = forkJoinPool.submit(new Calculator(0, 10000));  

    assertEquals(new Integer(49995000), result.get());  
}  
}  

参考资料：http://www.iteye.com/topic/643724