简易的递归

import java.util.ArrayList;
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 RecursiveTest implements Callable<Integer>{
	public int number=0;
	public RecursiveTest(int n){
		number=n;
	}
	public int count(int n){
		if(n==1|n==2)
			return 1;
		else{
			return count(n-1)+count(n-2);
		}
	}
	public Integer call(){
		return this.count(number);
	}
	public static void main(String[] args){
		//define the thread pool with ExecutorService
		ExecutorService exec=Executors.newCachedThreadPool();
		//初始化整形数组列表
		ArrayList<Future<Integer>> results=new ArrayList<Future<Integer>>();
		for(int i=5;i<8;i++)
			//当执行exec.submit自动执行call()
			results.add(exec.submit(new RecursiveTest(i)));
		for(Future<Integer> fi:results)
			try{
				//get()自动获取结果
				System.out.println(fi.get());
			}
		catch(InterruptedException e){
			System.out.println(e);
			return;
		}
		catch(ExecutionException e){
			System.out.println(e);
		}
		finally{
			exec.shutdown();
		}
	}
}