算法应用---斐波那契数列

package com.sinosoft.thesecondofaugust;
/**
 * 斐波那契数列：第一项和第二项均为1，以后各项都为前两项之和
 */
import java.util.Scanner;

public class Fbo {
public static void main(String[] args) {
	Scanner s = new Scanner(System.in);
	int num = s.nextInt();
	System.out.println("你想看的斐波那契数列：");
	f(num/2+1);
}
private static void f(int x){
	int f1=1,f2=1,i=3;
	if(x==1)System.out.print(f1);
	if(x==2)System.out.print(f1+" "+f2);
	if(x>=3){
		System.out.print(f1+" "+f2);
		while(x>=i){
			f1=f2+f1;
			System.out.print(" "+f1);
			i++;
			f2=f2+f1;
			System.out.print(" "+f2);
		}
	}
	
	
}
}

结果：