费波纳茨

//非递归实现
	static int[] fun(int num){
		int result[]= new int[num];
		for (int i = 1; i <= num; i++) {
			if(i<3){
				result[i-1]=i-1;
			}else{
				result[i-1]=result[i-2]+result[i-3];
			}
		}
		return result;
	}
//递归实现
	static int method(int num){
		int result = 0;
		if(num <= 2){
			result = --num;
		}else{
			result = method(num-1)+method(num-2);
		}
		return result;
	}