算法应用-斐波那契数列

斐波那契数列

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); } } } public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("请输入你想查看的斐波那契数列："); int num=s.nextInt(); System.out.println("你想看的斐波那契数列："); f(num/2+1); }

转载于:https://www.cnblogs.com/JPAORM/archive/2012/05/09/2509846.html