java 计算斐波那契数列的前20项，并用字节流方式输出到一个文件，每5项一行

java 计算斐波那契数列的前20项，并用字节流方式输出到一个文件，每5项一行

import java.io.FileWriter; public class Fibonacii { public String fibo(){ String str = ""; int a[] =new int[20]; a[0]=1; str = str + String.valueOf(a[0]); a[1]=1; str = str + " flag" + String.valueOf(a[1]); for(int i=2;i<20;i++){ a[i]=a[i-1]+a[i-2]; str = str + " flag" + String.valueOf(a[i]); } return str; } public static void main(String[] args) throws Exception { // TODO Auto-generated method stub Fibonacii f = new Fibonacii(); String str[] = f.fibo().split("flag"); FileWriter fw = new FileWriter("d:\\3.txt"); fw.write(str[0]); for(int i=1;i<20;i++){ if(i%5==0){ fw.write("\r\n"); fw.write(str[i]); }else{ fw.write(str[i]); } } fw.close(); } }

public class test{ public static void main(string []args){ test2 t=new test2(); t.math(); } } class test2{ public void math(){ int num1=1,num2=1; int num=num1+num2; system.out.print(" "+num1+" "+num2+" "+num); for(int i=3;i<20;i++){ int num3=num+num2; num2=num; num=num3; system.out.print(" "+num3); if(i%5==0){ system.out.println(); } } } }