JAVA编程思想第四版-多线程的练习答案之练习5

package exercise.exercise05;

public interface Generator<T> {
	T next();
}

package exercise.exercise05;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;

public class MainFibonacci implements Generator<Integer>,Callable<Integer>{

	int n;//n表示需要打印出来的fibonacci的个数
	int count;//标记产生的Fibonacci的次数
	public MainFibonacci(int n){
		
		this.n = n;
		System.out.println("exercise "+n);
	}
	
	public static void main(String[] args) {
		ExecutorService es = Executors.newCachedThreadPool();//成功后可以试着修改为一个参数的缓存池
		ArrayList<Future<Integer>> resultList = new ArrayList<Future<Integer>>();
		for (int i = 1; i < 10; i++) {
			resultList.add(es.submit(new MainFibonacci(i)));
		}
		int temp=1;
		for (Future<Integer> future : resultList) {
			try {
				System.out.println("前"+(temp++)+"fibonacci的值总和为："+future.get());
			} catch (InterruptedException e) {
				e.printStackTrace();
			} catch (ExecutionException e) {
				e.printStackTrace();
			}finally{
				es.shutdown();
			}
		}
	}

	@Override
	public Integer next() {
		return getFibonacci(count++);
	}
	
	public int getFibonacci(int fibo){
		if(0==fibo){//第0个Fibonacci数为：0
			return 0;
		}
		if(fibo<2){
			return 1;
		}
		return getFibonacci(fibo-1)+getFibonacci(fibo -2);
	}

	@Override
	public Integer call() throws Exception {
		Integer[] sequence = new Integer[n];
		int result = 0;
		for (int i = 0; i < n; i++) {
			sequence[i] = next();
			result+=sequence[i];
		}
		System.out.println("sequence "+n+" : "+Arrays.toString(sequence));
		
		return result;
	}
}

/** out put
 * Thread 1:[0]
 * Thread 2:[0,1]
 * Thread 3:[0,1,1]
 * Thread 4:[0,1,1,2]
 * */

博主才疏学浅，如发现问题，请指正！